./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:52:35,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:52:35,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:52:35,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:52:35,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:52:35,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:52:35,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:52:35,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:52:35,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:52:35,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:52:35,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:52:35,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:52:35,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:52:35,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:52:35,416 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:52:35,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:52:35,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:52:35,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:52:35,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:52:35,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:52:35,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:52:35,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:52:35,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:52:35,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:52:35,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:52:35,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:52:35,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:52:35,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:52:35,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:52:35,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:52:35,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:52:35,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:52:35,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:52:35,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:52:35,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:52:35,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:52:35,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:52:35,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:52:35,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:52:35,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:52:35,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:52:35,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:52:35,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc [2024-11-16 15:52:35,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:52:35,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:52:35,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:52:35,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:52:35,728 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:52:35,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-11-16 15:52:37,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:52:37,458 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:52:37,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-11-16 15:52:37,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c853803d7/f4bf47ebbe3f4252a352f757268972cd/FLAG05cf26b15 [2024-11-16 15:52:37,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c853803d7/f4bf47ebbe3f4252a352f757268972cd [2024-11-16 15:52:37,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:52:37,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:52:37,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:52:37,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:52:37,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:52:37,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:52:37" (1/1) ... [2024-11-16 15:52:37,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd8ac69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:37, skipping insertion in model container [2024-11-16 15:52:37,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:52:37" (1/1) ... [2024-11-16 15:52:37,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:52:38,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-11-16 15:52:38,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:52:38,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:52:38,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-11-16 15:52:38,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:52:38,200 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:52:38,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38 WrapperNode [2024-11-16 15:52:38,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:52:38,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:52:38,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:52:38,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:52:38,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,272 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-16 15:52:38,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:52:38,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:52:38,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:52:38,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:52:38,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,314 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:52:38,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:52:38,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:52:38,345 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:52:38,345 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:52:38,346 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (1/1) ... [2024-11-16 15:52:38,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:52:38,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:52:38,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:52:38,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:52:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:52:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:52:38,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:52:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:52:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:52:38,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:52:38,513 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:52:38,517 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:52:38,812 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~short18#1; [2024-11-16 15:52:38,840 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 15:52:38,840 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:52:38,857 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:52:38,858 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:52:38,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:52:38 BoogieIcfgContainer [2024-11-16 15:52:38,858 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:52:38,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:52:38,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:52:38,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:52:38,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:52:37" (1/3) ... [2024-11-16 15:52:38,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138655bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:52:38, skipping insertion in model container [2024-11-16 15:52:38,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:38" (2/3) ... [2024-11-16 15:52:38,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138655bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:52:38, skipping insertion in model container [2024-11-16 15:52:38,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:52:38" (3/3) ... [2024-11-16 15:52:38,869 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-70.i [2024-11-16 15:52:38,886 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:52:38,887 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:52:38,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:52:38,951 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26c54aee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:52:38,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:52:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 15:52:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 15:52:38,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:38,972 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:38,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:38,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1100725191, now seen corresponding path program 1 times [2024-11-16 15:52:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202375674] [2024-11-16 15:52:38,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:39,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:39,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202375674] [2024-11-16 15:52:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202375674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:39,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:39,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:52:39,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015506135] [2024-11-16 15:52:39,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:39,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:52:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:39,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:52:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:52:39,491 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 15:52:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:39,531 INFO L93 Difference]: Finished difference Result 126 states and 201 transitions. [2024-11-16 15:52:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:52:39,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 109 [2024-11-16 15:52:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:39,543 INFO L225 Difference]: With dead ends: 126 [2024-11-16 15:52:39,544 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 15:52:39,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:52:39,553 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:39,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:52:39,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 15:52:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 15:52:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 15:52:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2024-11-16 15:52:39,599 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 109 [2024-11-16 15:52:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:39,601 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2024-11-16 15:52:39,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 15:52:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2024-11-16 15:52:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 15:52:39,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:39,606 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:39,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:52:39,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:39,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash -413979705, now seen corresponding path program 1 times [2024-11-16 15:52:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:39,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973786683] [2024-11-16 15:52:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:39,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973786683] [2024-11-16 15:52:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973786683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:39,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:39,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:52:39,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153444043] [2024-11-16 15:52:39,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:39,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:52:39,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:39,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:52:39,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:39,854 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:39,929 INFO L93 Difference]: Finished difference Result 121 states and 173 transitions. [2024-11-16 15:52:39,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:52:39,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-11-16 15:52:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:39,932 INFO L225 Difference]: With dead ends: 121 [2024-11-16 15:52:39,932 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 15:52:39,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:39,934 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:39,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:52:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 15:52:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 15:52:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 15:52:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2024-11-16 15:52:39,943 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 109 [2024-11-16 15:52:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:39,945 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2024-11-16 15:52:39,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2024-11-16 15:52:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:52:39,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:39,947 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:39,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:52:39,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:39,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash 148278828, now seen corresponding path program 1 times [2024-11-16 15:52:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233928182] [2024-11-16 15:52:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:40,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233928182] [2024-11-16 15:52:40,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233928182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:40,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:40,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:52:40,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365145399] [2024-11-16 15:52:40,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:40,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:52:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:40,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:52:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:40,281 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:40,356 INFO L93 Difference]: Finished difference Result 121 states and 171 transitions. [2024-11-16 15:52:40,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:52:40,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-16 15:52:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:40,362 INFO L225 Difference]: With dead ends: 121 [2024-11-16 15:52:40,364 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 15:52:40,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:40,365 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:40,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:52:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 15:52:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 15:52:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 15:52:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-11-16 15:52:40,382 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 111 [2024-11-16 15:52:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:40,383 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-11-16 15:52:40,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-16 15:52:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:52:40,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:40,387 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:40,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:52:40,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:40,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1891089163, now seen corresponding path program 1 times [2024-11-16 15:52:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:40,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261473758] [2024-11-16 15:52:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:47,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:47,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261473758] [2024-11-16 15:52:47,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261473758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:47,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:47,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 15:52:47,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861759023] [2024-11-16 15:52:47,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:47,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 15:52:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:47,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 15:52:47,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-16 15:52:47,301 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:50,004 INFO L93 Difference]: Finished difference Result 208 states and 278 transitions. [2024-11-16 15:52:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 15:52:50,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-16 15:52:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:50,007 INFO L225 Difference]: With dead ends: 208 [2024-11-16 15:52:50,007 INFO L226 Difference]: Without dead ends: 149 [2024-11-16 15:52:50,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-16 15:52:50,009 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 120 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:50,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 504 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:52:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-16 15:52:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 74. [2024-11-16 15:52:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 15:52:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-11-16 15:52:50,020 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 111 [2024-11-16 15:52:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:50,021 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-16 15:52:50,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-11-16 15:52:50,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:52:50,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:50,026 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:50,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:52:50,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:50,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:50,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1694575658, now seen corresponding path program 1 times [2024-11-16 15:52:50,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:50,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236488861] [2024-11-16 15:52:50,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:51,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:51,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236488861] [2024-11-16 15:52:51,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236488861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:51,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:51,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 15:52:51,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569684898] [2024-11-16 15:52:51,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:51,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:52:51,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:51,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:52:51,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:52:51,086 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:51,490 INFO L93 Difference]: Finished difference Result 198 states and 266 transitions. [2024-11-16 15:52:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:52:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-16 15:52:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:51,494 INFO L225 Difference]: With dead ends: 198 [2024-11-16 15:52:51,494 INFO L226 Difference]: Without dead ends: 127 [2024-11-16 15:52:51,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:52:51,495 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 62 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:51,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 381 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:52:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-16 15:52:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 75. [2024-11-16 15:52:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 57 states have internal predecessors, (71), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 15:52:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2024-11-16 15:52:51,507 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 111 [2024-11-16 15:52:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:51,508 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2024-11-16 15:52:51,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2024-11-16 15:52:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:52:51,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:51,513 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:51,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:52:51,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:51,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1893343956, now seen corresponding path program 1 times [2024-11-16 15:52:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:51,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180361666] [2024-11-16 15:52:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:51,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:51,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180361666] [2024-11-16 15:52:51,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180361666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:51,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:51,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:52:51,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915492010] [2024-11-16 15:52:51,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:51,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:52:51,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:51,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:52:51,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:52:51,923 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:52,584 INFO L93 Difference]: Finished difference Result 235 states and 320 transitions. [2024-11-16 15:52:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 15:52:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-16 15:52:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:52,586 INFO L225 Difference]: With dead ends: 235 [2024-11-16 15:52:52,586 INFO L226 Difference]: Without dead ends: 163 [2024-11-16 15:52:52,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-16 15:52:52,588 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 151 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:52,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 510 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 15:52:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-16 15:52:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 109. [2024-11-16 15:52:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.25) internal successors, (110), 89 states have internal predecessors, (110), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:52:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 146 transitions. [2024-11-16 15:52:52,608 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 146 transitions. Word has length 111 [2024-11-16 15:52:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:52,608 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 146 transitions. [2024-11-16 15:52:52,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 146 transitions. [2024-11-16 15:52:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:52:52,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:52,610 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 15:52:52,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2089857461, now seen corresponding path program 1 times [2024-11-16 15:52:52,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:52,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921950074] [2024-11-16 15:52:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921950074] [2024-11-16 15:52:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921950074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:53,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:52:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704340147] [2024-11-16 15:52:53,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:53,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:52:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:52:53,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:52:53,917 INFO L87 Difference]: Start difference. First operand 109 states and 146 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:54,199 INFO L93 Difference]: Finished difference Result 235 states and 311 transitions. [2024-11-16 15:52:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:52:54,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-16 15:52:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:54,202 INFO L225 Difference]: With dead ends: 235 [2024-11-16 15:52:54,203 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 15:52:54,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:52:54,204 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 61 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:54,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 291 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:52:54,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 15:52:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2024-11-16 15:52:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 89 states have internal predecessors, (109), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:52:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 145 transitions. [2024-11-16 15:52:54,214 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 145 transitions. Word has length 111 [2024-11-16 15:52:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:54,214 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 145 transitions. [2024-11-16 15:52:54,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 145 transitions. [2024-11-16 15:52:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:52:54,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:54,216 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:54,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 15:52:54,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:54,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1050568436, now seen corresponding path program 1 times [2024-11-16 15:52:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:54,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922562640] [2024-11-16 15:52:54,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:54,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:54,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:54,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922562640] [2024-11-16 15:52:54,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922562640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:54,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:52:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322973910] [2024-11-16 15:52:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:54,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:52:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:54,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:52:54,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:52:54,416 INFO L87 Difference]: Start difference. First operand 109 states and 145 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:54,488 INFO L93 Difference]: Finished difference Result 232 states and 307 transitions. [2024-11-16 15:52:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:52:54,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-16 15:52:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:54,491 INFO L225 Difference]: With dead ends: 232 [2024-11-16 15:52:54,493 INFO L226 Difference]: Without dead ends: 126 [2024-11-16 15:52:54,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:52:54,494 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 28 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:54,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 478 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:52:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-16 15:52:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2024-11-16 15:52:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 77 states have internal predecessors, (92), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:52:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2024-11-16 15:52:54,509 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 111 [2024-11-16 15:52:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:54,509 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2024-11-16 15:52:54,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2024-11-16 15:52:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 15:52:54,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:54,510 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:54,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 15:52:54,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:54,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash 984106804, now seen corresponding path program 1 times [2024-11-16 15:52:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:54,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703204] [2024-11-16 15:52:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:54,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:54,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703204] [2024-11-16 15:52:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:54,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:54,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:52:54,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708999357] [2024-11-16 15:52:54,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:54,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:52:54,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:54,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:52:54,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:54,593 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:54,633 INFO L93 Difference]: Finished difference Result 191 states and 253 transitions. [2024-11-16 15:52:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:52:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-11-16 15:52:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:54,635 INFO L225 Difference]: With dead ends: 191 [2024-11-16 15:52:54,635 INFO L226 Difference]: Without dead ends: 97 [2024-11-16 15:52:54,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:54,636 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:54,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:52:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-16 15:52:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-16 15:52:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:52:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2024-11-16 15:52:54,644 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 114 [2024-11-16 15:52:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:54,644 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2024-11-16 15:52:54,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2024-11-16 15:52:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 15:52:54,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:54,646 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:54,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 15:52:54,646 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:54,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:54,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2000725447, now seen corresponding path program 1 times [2024-11-16 15:52:54,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:54,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340506522] [2024-11-16 15:52:54,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:54,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:55,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:55,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340506522] [2024-11-16 15:52:55,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340506522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:55,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:55,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 15:52:55,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003756613] [2024-11-16 15:52:55,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:55,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 15:52:55,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:55,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 15:52:55,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-16 15:52:55,706 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:57,161 INFO L93 Difference]: Finished difference Result 271 states and 337 transitions. [2024-11-16 15:52:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-16 15:52:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-16 15:52:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:57,164 INFO L225 Difference]: With dead ends: 271 [2024-11-16 15:52:57,164 INFO L226 Difference]: Without dead ends: 268 [2024-11-16 15:52:57,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 15:52:57,166 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 392 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:57,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 703 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 15:52:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-16 15:52:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 138. [2024-11-16 15:52:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 104 states have (on average 1.1826923076923077) internal successors, (123), 106 states have internal predecessors, (123), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 15:52:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 183 transitions. [2024-11-16 15:52:57,185 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 183 transitions. Word has length 116 [2024-11-16 15:52:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:57,185 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 183 transitions. [2024-11-16 15:52:57,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 183 transitions. [2024-11-16 15:52:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 15:52:57,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:57,188 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:57,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 15:52:57,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:57,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:57,189 INFO L85 PathProgramCache]: Analyzing trace with hash -493173638, now seen corresponding path program 1 times [2024-11-16 15:52:57,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:57,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438950904] [2024-11-16 15:52:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:58,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:58,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438950904] [2024-11-16 15:52:58,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438950904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:58,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:58,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 15:52:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865831913] [2024-11-16 15:52:58,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 15:52:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:58,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 15:52:58,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-16 15:52:58,171 INFO L87 Difference]: Start difference. First operand 138 states and 183 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:59,016 INFO L93 Difference]: Finished difference Result 306 states and 399 transitions. [2024-11-16 15:52:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 15:52:59,017 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-16 15:52:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:59,019 INFO L225 Difference]: With dead ends: 306 [2024-11-16 15:52:59,019 INFO L226 Difference]: Without dead ends: 191 [2024-11-16 15:52:59,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-16 15:52:59,020 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 95 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:59,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 556 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 15:52:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-16 15:52:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 128. [2024-11-16 15:52:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 97 states have internal predecessors, (112), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:52:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2024-11-16 15:52:59,033 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 116 [2024-11-16 15:52:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:59,033 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2024-11-16 15:52:59,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2024-11-16 15:52:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 15:52:59,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:59,036 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:59,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 15:52:59,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:59,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash -795234264, now seen corresponding path program 1 times [2024-11-16 15:52:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813996669] [2024-11-16 15:52:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:59,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813996669] [2024-11-16 15:52:59,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813996669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:59,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:59,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:52:59,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495319399] [2024-11-16 15:52:59,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:59,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:52:59,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:52:59,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:59,101 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:59,167 INFO L93 Difference]: Finished difference Result 278 states and 359 transitions. [2024-11-16 15:52:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:52:59,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-16 15:52:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:59,169 INFO L225 Difference]: With dead ends: 278 [2024-11-16 15:52:59,170 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 15:52:59,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:59,170 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 65 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:59,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 174 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:52:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 15:52:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2024-11-16 15:52:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 111 states have (on average 1.1081081081081081) internal successors, (123), 113 states have internal predecessors, (123), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 15:52:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2024-11-16 15:52:59,195 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 117 [2024-11-16 15:52:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:59,197 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2024-11-16 15:52:59,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2024-11-16 15:52:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 15:52:59,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:59,198 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:59,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 15:52:59,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:59,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1425680128, now seen corresponding path program 1 times [2024-11-16 15:52:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:59,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140264405] [2024-11-16 15:52:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:52:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:52:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:52:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:52:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:52:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:52:59,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:59,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140264405] [2024-11-16 15:52:59,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140264405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:59,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:59,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:52:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899138696] [2024-11-16 15:52:59,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:59,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:52:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:59,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:52:59,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:59,264 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:59,322 INFO L93 Difference]: Finished difference Result 295 states and 380 transitions. [2024-11-16 15:52:59,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:52:59,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-16 15:52:59,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:59,324 INFO L225 Difference]: With dead ends: 295 [2024-11-16 15:52:59,325 INFO L226 Difference]: Without dead ends: 156 [2024-11-16 15:52:59,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:59,327 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:59,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:52:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-16 15:52:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2024-11-16 15:52:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 103 states have internal predecessors, (108), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 15:52:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2024-11-16 15:52:59,351 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 118 [2024-11-16 15:52:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:59,351 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2024-11-16 15:52:59,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:52:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2024-11-16 15:52:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 15:52:59,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:59,353 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:59,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 15:52:59,354 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:59,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 157696089, now seen corresponding path program 1 times [2024-11-16 15:52:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:59,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352704597] [2024-11-16 15:52:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:52:59,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:52:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:52:59,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:52:59,454 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:52:59,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:52:59,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 15:52:59,460 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:59,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:52:59,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:52:59 BoogieIcfgContainer [2024-11-16 15:52:59,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:52:59,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:52:59,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:52:59,557 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:52:59,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:52:38" (3/4) ... [2024-11-16 15:52:59,560 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:52:59,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:52:59,561 INFO L158 Benchmark]: Toolchain (without parser) took 21738.42ms. Allocated memory was 165.7MB in the beginning and 434.1MB in the end (delta: 268.4MB). Free memory was 108.0MB in the beginning and 219.3MB in the end (delta: -111.3MB). Peak memory consumption was 161.1MB. Max. memory is 16.1GB. [2024-11-16 15:52:59,562 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:52:59,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.32ms. Allocated memory is still 165.7MB. Free memory was 108.0MB in the beginning and 93.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 15:52:59,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.13ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:52:59,562 INFO L158 Benchmark]: Boogie Preprocessor took 65.52ms. Allocated memory is still 165.7MB. Free memory was 90.4MB in the beginning and 87.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:52:59,563 INFO L158 Benchmark]: IcfgBuilder took 517.04ms. Allocated memory is still 165.7MB. Free memory was 87.0MB in the beginning and 66.7MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 15:52:59,563 INFO L158 Benchmark]: TraceAbstraction took 20694.22ms. Allocated memory was 165.7MB in the beginning and 434.1MB in the end (delta: 268.4MB). Free memory was 65.8MB in the beginning and 219.3MB in the end (delta: -153.5MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. [2024-11-16 15:52:59,564 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 434.1MB. Free memory is still 219.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:52:59,568 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.32ms. Allocated memory is still 165.7MB. Free memory was 108.0MB in the beginning and 93.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.13ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.52ms. Allocated memory is still 165.7MB. Free memory was 90.4MB in the beginning and 87.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 517.04ms. Allocated memory is still 165.7MB. Free memory was 87.0MB in the beginning and 66.7MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20694.22ms. Allocated memory was 165.7MB in the beginning and 434.1MB in the end (delta: 268.4MB). Free memory was 65.8MB in the beginning and 219.3MB in the end (delta: -153.5MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 434.1MB. Free memory is still 219.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] signed long int var_1_8 = 8; [L28] signed long int var_1_9 = 255; [L29] signed long int var_1_10 = 10000000; [L30] signed long int var_1_11 = 0; [L31] signed long int var_1_12 = 255; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; VAL [isInitial=0, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L67] var_1_9 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L70] var_1_10 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L73] var_1_11 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L76] var_1_12 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L79] var_1_14 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L80] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L81] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L82] var_1_16 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L83] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L84] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L97] RET updateVariables() [L98] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=-35619, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=-35619, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=-35619, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=-35619, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=-35619, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] COND TRUE stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)))) [L49] var_1_7 = (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=8, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=8, var_1_9=0] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89-L90] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((signed long int) (var_1_9 - var_1_10))) : (var_1_8 == ((signed long int) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-127, var_1_16=-127, var_1_1=47136, var_1_2=1, var_1_4=-35619, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1036 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1036 mSDsluCounter, 4238 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3078 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2804 IncrementalHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 1160 mSDtfsCounter, 2804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=12, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 438 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1585 NumberOfCodeBlocks, 1585 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1452 ConstructedInterpolants, 0 QuantifiedInterpolants, 6882 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 6240/6240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 15:52:59,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:53:01,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:53:01,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:53:01,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:53:01,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:53:01,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:53:01,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:53:01,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:53:01,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:53:01,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:53:01,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:53:01,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:53:01,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:53:01,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:53:01,904 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:53:01,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:53:01,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:53:01,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:53:01,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:53:01,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:53:01,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:53:01,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:53:01,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:53:01,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:53:01,911 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:53:01,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:53:01,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:53:01,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:53:01,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:53:01,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:53:01,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:53:01,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:53:01,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:53:01,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:53:01,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:53:01,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:53:01,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:53:01,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:53:01,915 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:53:01,916 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:53:01,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:53:01,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:53:01,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:53:01,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:53:01,917 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc [2024-11-16 15:53:02,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:53:02,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:53:02,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:53:02,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:53:02,260 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:53:02,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-11-16 15:53:03,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:53:03,941 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:53:03,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-11-16 15:53:03,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a183936/38596094fc4d4804b3dd50d469fb279c/FLAG5caed290f [2024-11-16 15:53:04,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a183936/38596094fc4d4804b3dd50d469fb279c [2024-11-16 15:53:04,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:53:04,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:53:04,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:53:04,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:53:04,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:53:04,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160ee49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04, skipping insertion in model container [2024-11-16 15:53:04,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:53:04,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-11-16 15:53:04,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:53:04,592 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:53:04,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-11-16 15:53:04,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:53:04,683 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:53:04,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04 WrapperNode [2024-11-16 15:53:04,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:53:04,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:53:04,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:53:04,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:53:04,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,730 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-16 15:53:04,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:53:04,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:53:04,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:53:04,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:53:04,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,769 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:53:04,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:53:04,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:53:04,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:53:04,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:53:04,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (1/1) ... [2024-11-16 15:53:04,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:53:04,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:53:04,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:53:04,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:53:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:53:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:53:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:53:04,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:53:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:53:04,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:53:04,948 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:53:04,950 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:53:05,188 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 15:53:05,192 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:53:05,209 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:53:05,209 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:53:05,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:53:05 BoogieIcfgContainer [2024-11-16 15:53:05,210 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:53:05,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:53:05,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:53:05,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:53:05,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:53:04" (1/3) ... [2024-11-16 15:53:05,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7597bac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:53:05, skipping insertion in model container [2024-11-16 15:53:05,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:04" (2/3) ... [2024-11-16 15:53:05,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7597bac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:53:05, skipping insertion in model container [2024-11-16 15:53:05,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:53:05" (3/3) ... [2024-11-16 15:53:05,222 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-70.i [2024-11-16 15:53:05,240 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:53:05,240 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:53:05,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:53:05,321 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a9d043c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:53:05,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:53:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 15:53:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 15:53:05,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:53:05,341 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:53:05,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:53:05,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:53:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2105766110, now seen corresponding path program 1 times [2024-11-16 15:53:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:53:05,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320716192] [2024-11-16 15:53:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:53:05,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:53:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:53:05,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:53:05,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 15:53:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:53:05,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:53:05,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:53:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-16 15:53:05,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:53:05,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:53:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320716192] [2024-11-16 15:53:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320716192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:53:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:53:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:53:05,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127234347] [2024-11-16 15:53:05,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:53:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:53:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:53:05,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:53:05,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:53:05,645 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 15:53:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:53:05,664 INFO L93 Difference]: Finished difference Result 96 states and 157 transitions. [2024-11-16 15:53:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:53:05,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2024-11-16 15:53:05,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:53:05,673 INFO L225 Difference]: With dead ends: 96 [2024-11-16 15:53:05,673 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 15:53:05,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:53:05,678 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:53:05,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:53:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 15:53:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-16 15:53:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 15:53:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-11-16 15:53:05,720 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 105 [2024-11-16 15:53:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:53:05,720 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-11-16 15:53:05,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 15:53:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-11-16 15:53:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 15:53:05,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:53:05,723 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:53:05,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 15:53:05,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:53:05,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:53:05,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:53:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash 225181474, now seen corresponding path program 1 times [2024-11-16 15:53:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:53:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39255314] [2024-11-16 15:53:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:53:05,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:53:05,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:53:05,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:53:05,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 15:53:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:53:06,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 15:53:06,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:53:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 15:53:06,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:53:06,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:53:06,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39255314] [2024-11-16 15:53:06,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39255314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:53:06,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:53:06,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:53:06,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333553677] [2024-11-16 15:53:06,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:53:06,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:53:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:53:06,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:53:06,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:53:06,125 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:53:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:53:06,166 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2024-11-16 15:53:06,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:53:06,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-16 15:53:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:53:06,172 INFO L225 Difference]: With dead ends: 91 [2024-11-16 15:53:06,172 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 15:53:06,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:53:06,175 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:53:06,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:53:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 15:53:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-16 15:53:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 15:53:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-16 15:53:06,196 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 105 [2024-11-16 15:53:06,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:53:06,199 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-16 15:53:06,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 15:53:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-16 15:53:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 15:53:06,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:53:06,201 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:53:06,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 15:53:06,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:53:06,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:53:06,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:53:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash 253810625, now seen corresponding path program 1 times [2024-11-16 15:53:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:53:06,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722022039] [2024-11-16 15:53:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:53:06,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:53:06,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:53:06,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:53:06,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 15:53:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:53:06,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 15:53:06,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:53:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 138 proven. 72 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-16 15:53:07,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:53:07,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:53:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722022039] [2024-11-16 15:53:07,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722022039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:53:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [461401918] [2024-11-16 15:53:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:53:07,329 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 15:53:07,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 15:53:07,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 15:53:07,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-16 15:53:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:53:07,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 15:53:07,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:53:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-16 15:53:07,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:53:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [461401918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:53:07,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 15:53:07,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2024-11-16 15:53:07,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507979070] [2024-11-16 15:53:07,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 15:53:07,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 15:53:07,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:53:07,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 15:53:07,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-16 15:53:07,946 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-16 15:53:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:53:08,566 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2024-11-16 15:53:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 15:53:08,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 105 [2024-11-16 15:53:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:53:08,569 INFO L225 Difference]: With dead ends: 125 [2024-11-16 15:53:08,569 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 15:53:08,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-11-16 15:53:08,571 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 87 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:53:08,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 142 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:53:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 15:53:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2024-11-16 15:53:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:53:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2024-11-16 15:53:08,584 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 105 [2024-11-16 15:53:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:53:08,585 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2024-11-16 15:53:08,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-16 15:53:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2024-11-16 15:53:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 15:53:08,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:53:08,587 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:53:08,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 15:53:08,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-16 15:53:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 15:53:08,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:53:08,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:53:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 57297120, now seen corresponding path program 1 times [2024-11-16 15:53:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:53:08,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620552450] [2024-11-16 15:53:08,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:53:08,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:53:08,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:53:08,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:53:08,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 15:53:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:53:09,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 15:53:09,102 INFO L278 TraceCheckSpWp]: Computing forward predicates...