./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.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 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:13:34,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:13:34,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:13:34,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:13:34,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:13:34,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:13:34,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:13:34,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:13:34,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:13:34,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:13:34,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:13:34,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:13:34,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:13:34,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:13:34,660 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:13:34,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:13:34,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:13:34,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:13:34,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:13:34,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:13:34,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:13:34,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:13:34,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:13:34,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:13:34,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:13:34,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:13:34,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:13:34,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:13:34,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:13:34,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:13:34,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:13:34,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:13:34,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:13:34,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:13:34,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:13:34,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:13:34,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:13:34,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:13:34,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:13:34,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:13:34,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:13:34,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:13:34,668 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 -> 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 [2024-10-13 02:13:34,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:13:34,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:13:34,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:13:34,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:13:34,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:13:34,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-13 02:13:36,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:13:36,435 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:13:36,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-13 02:13:36,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d2f7e98/2850528b0c67415582a7279e2a5e69fe/FLAG365465979 [2024-10-13 02:13:36,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d2f7e98/2850528b0c67415582a7279e2a5e69fe [2024-10-13 02:13:36,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:13:36,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:13:36,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:13:36,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:13:36,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:13:36,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:13:36" (1/1) ... [2024-10-13 02:13:36,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c38e3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:36, skipping insertion in model container [2024-10-13 02:13:36,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:13:36" (1/1) ... [2024-10-13 02:13:36,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:13:36,985 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-75.i[919,932] [2024-10-13 02:13:37,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:13:37,060 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:13:37,069 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-75.i[919,932] [2024-10-13 02:13:37,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:13:37,126 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:13:37,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37 WrapperNode [2024-10-13 02:13:37,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:13:37,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:13:37,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:13:37,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:13:37,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,176 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-10-13 02:13:37,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:13:37,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:13:37,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:13:37,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:13:37,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,210 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-10-13 02:13:37,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:13:37,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:13:37,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:13:37,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:13:37,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (1/1) ... [2024-10-13 02:13:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:13:37,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:13:37,278 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-10-13 02:13:37,281 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-10-13 02:13:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:13:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:13:37,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:13:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:13:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:13:37,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:13:37,403 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:13:37,405 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:13:37,841 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:13:37,841 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:13:37,916 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:13:37,917 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:13:37,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:13:37 BoogieIcfgContainer [2024-10-13 02:13:37,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:13:37,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:13:37,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:13:37,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:13:37,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:13:36" (1/3) ... [2024-10-13 02:13:37,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1476d684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:13:37, skipping insertion in model container [2024-10-13 02:13:37,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:37" (2/3) ... [2024-10-13 02:13:37,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1476d684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:13:37, skipping insertion in model container [2024-10-13 02:13:37,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:13:37" (3/3) ... [2024-10-13 02:13:37,928 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-13 02:13:37,943 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:13:37,944 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:13:38,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:13:38,013 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;@48c354b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:13:38,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:13:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 74 states have (on average 1.554054054054054) internal successors, (115), 75 states have internal predecessors, (115), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:13:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 02:13:38,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:38,029 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:38,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:38,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1581202767, now seen corresponding path program 1 times [2024-10-13 02:13:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:38,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036349405] [2024-10-13 02:13:38,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:38,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:13:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:13:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:13:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:13:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:13:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:13:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:13:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:13:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:13:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:13:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:13:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:13:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:13:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:13:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:13:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:13:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:13:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:13:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:13:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:13:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:13:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:13:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:13:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:13:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:13:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:13:38,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036349405] [2024-10-13 02:13:38,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036349405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:13:38,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:13:38,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:13:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968123375] [2024-10-13 02:13:38,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:13:38,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:13:38,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:13:38,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:13:38,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:13:38,506 INFO L87 Difference]: Start difference. First operand has 101 states, 74 states have (on average 1.554054054054054) internal successors, (115), 75 states have internal predecessors, (115), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:13:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:38,544 INFO L93 Difference]: Finished difference Result 198 states and 347 transitions. [2024-10-13 02:13:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:13:38,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-10-13 02:13:38,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:38,557 INFO L225 Difference]: With dead ends: 198 [2024-10-13 02:13:38,557 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 02:13:38,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-10-13 02:13:38,565 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:38,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:13:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 02:13:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-13 02:13:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 72 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:13:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2024-10-13 02:13:38,607 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 160 [2024-10-13 02:13:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:38,608 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2024-10-13 02:13:38,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:13:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2024-10-13 02:13:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 02:13:38,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:38,616 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:38,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:13:38,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:38,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:38,618 INFO L85 PathProgramCache]: Analyzing trace with hash 732342797, now seen corresponding path program 1 times [2024-10-13 02:13:38,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:38,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411421239] [2024-10-13 02:13:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:38,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:13:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:13:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:13:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:13:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:13:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:13:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:13:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:13:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:13:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:13:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:13:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:13:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:13:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:13:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:13:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:13:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:13:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:13:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:13:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:13:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:13:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:13:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:13:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:13:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:13:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:13:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411421239] [2024-10-13 02:13:38,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411421239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:13:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:13:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:13:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105933704] [2024-10-13 02:13:38,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:13:38,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:13:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:13:38,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:13:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:13:38,936 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:39,135 INFO L93 Difference]: Finished difference Result 282 states and 449 transitions. [2024-10-13 02:13:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:13:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-13 02:13:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:39,142 INFO L225 Difference]: With dead ends: 282 [2024-10-13 02:13:39,142 INFO L226 Difference]: Without dead ends: 185 [2024-10-13 02:13:39,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-10-13 02:13:39,144 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 125 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:39,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 311 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:13:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-13 02:13:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2024-10-13 02:13:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 125 states have (on average 1.392) internal successors, (174), 125 states have internal predecessors, (174), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:13:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 270 transitions. [2024-10-13 02:13:39,169 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 270 transitions. Word has length 161 [2024-10-13 02:13:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:39,169 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 270 transitions. [2024-10-13 02:13:39,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 270 transitions. [2024-10-13 02:13:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 02:13:39,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:39,173 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:39,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:13:39,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:39,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:39,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1229871841, now seen corresponding path program 1 times [2024-10-13 02:13:39,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:39,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088601223] [2024-10-13 02:13:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:13:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:13:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:13:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:13:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:13:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:13:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:13:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:13:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:13:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:13:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:13:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:13:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:13:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:13:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:13:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:13:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:13:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:13:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:13:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:13:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:13:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:13:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:13:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:13:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:13:39,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:13:39,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088601223] [2024-10-13 02:13:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088601223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:13:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:13:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:13:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799723362] [2024-10-13 02:13:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:13:39,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:13:39,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:13:39,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:13:39,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:13:39,580 INFO L87 Difference]: Start difference. First operand 176 states and 270 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:39,682 INFO L93 Difference]: Finished difference Result 407 states and 628 transitions. [2024-10-13 02:13:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:13:39,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-13 02:13:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:39,685 INFO L225 Difference]: With dead ends: 407 [2024-10-13 02:13:39,685 INFO L226 Difference]: Without dead ends: 232 [2024-10-13 02:13:39,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-10-13 02:13:39,692 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 46 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:39,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 253 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:13:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-13 02:13:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2024-10-13 02:13:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 146 states have internal predecessors, (196), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 02:13:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 340 transitions. [2024-10-13 02:13:39,723 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 340 transitions. Word has length 162 [2024-10-13 02:13:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:39,723 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 340 transitions. [2024-10-13 02:13:39,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 340 transitions. [2024-10-13 02:13:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 02:13:39,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:39,729 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:39,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:13:39,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:39,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:39,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1161081676, now seen corresponding path program 1 times [2024-10-13 02:13:39,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:39,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259543700] [2024-10-13 02:13:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:39,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:13:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:13:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:13:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:13:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:13:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:13:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:13:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:13:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:13:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:13:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:13:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:13:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:13:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:13:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:13:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:13:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:13:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:13:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:13:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:13:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:13:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:13:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:13:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:13:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:13:40,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:13:40,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259543700] [2024-10-13 02:13:40,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259543700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:13:40,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:13:40,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:13:40,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813598694] [2024-10-13 02:13:40,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:13:40,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:13:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:13:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:13:40,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:13:40,177 INFO L87 Difference]: Start difference. First operand 222 states and 340 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:40,745 INFO L93 Difference]: Finished difference Result 577 states and 889 transitions. [2024-10-13 02:13:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 02:13:40,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-10-13 02:13:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:40,749 INFO L225 Difference]: With dead ends: 577 [2024-10-13 02:13:40,749 INFO L226 Difference]: Without dead ends: 402 [2024-10-13 02:13:40,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:13:40,755 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 377 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:40,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 547 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:13:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-13 02:13:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 378. [2024-10-13 02:13:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 260 states have (on average 1.353846153846154) internal successors, (352), 261 states have internal predecessors, (352), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-13 02:13:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 574 transitions. [2024-10-13 02:13:40,821 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 574 transitions. Word has length 163 [2024-10-13 02:13:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:40,824 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 574 transitions. [2024-10-13 02:13:40,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 574 transitions. [2024-10-13 02:13:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 02:13:40,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:40,826 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:40,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:13:40,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:40,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2086162910, now seen corresponding path program 1 times [2024-10-13 02:13:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740685201] [2024-10-13 02:13:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:13:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:13:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:13:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:13:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:13:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:13:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:13:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:13:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:13:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:13:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:13:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:13:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:13:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:13:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:13:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:13:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:13:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:13:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:13:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:13:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:13:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:13:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:13:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:13:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:13:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:13:41,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740685201] [2024-10-13 02:13:41,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740685201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:13:41,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:13:41,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:13:41,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601189166] [2024-10-13 02:13:41,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:13:41,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:13:41,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:13:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:13:41,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:13:41,014 INFO L87 Difference]: Start difference. First operand 378 states and 574 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:41,106 INFO L93 Difference]: Finished difference Result 694 states and 1055 transitions. [2024-10-13 02:13:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:13:41,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-10-13 02:13:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:41,111 INFO L225 Difference]: With dead ends: 694 [2024-10-13 02:13:41,111 INFO L226 Difference]: Without dead ends: 378 [2024-10-13 02:13:41,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-10-13 02:13:41,114 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:41,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:13:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-13 02:13:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2024-10-13 02:13:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 261 states have internal predecessors, (350), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-13 02:13:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 572 transitions. [2024-10-13 02:13:41,148 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 572 transitions. Word has length 163 [2024-10-13 02:13:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:41,149 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 572 transitions. [2024-10-13 02:13:41,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 572 transitions. [2024-10-13 02:13:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 02:13:41,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:41,150 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:41,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:13:41,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:41,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1393429382, now seen corresponding path program 1 times [2024-10-13 02:13:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:41,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038516765] [2024-10-13 02:13:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:13:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:13:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:13:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:13:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:13:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:13:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:13:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:13:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:13:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:13:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:13:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:13:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:13:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:13:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:13:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:13:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:13:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:13:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:13:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:13:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:13:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:13:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:13:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:13:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:13:41,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:13:41,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038516765] [2024-10-13 02:13:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038516765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:13:41,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:13:41,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:13:41,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604966849] [2024-10-13 02:13:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:13:41,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:13:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:13:41,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:13:41,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:13:41,517 INFO L87 Difference]: Start difference. First operand 378 states and 572 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:13:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:42,426 INFO L93 Difference]: Finished difference Result 711 states and 1080 transitions. [2024-10-13 02:13:42,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:13:42,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2024-10-13 02:13:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:42,430 INFO L225 Difference]: With dead ends: 711 [2024-10-13 02:13:42,430 INFO L226 Difference]: Without dead ends: 403 [2024-10-13 02:13:42,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-13 02:13:42,432 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 355 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:42,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 797 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 02:13:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-13 02:13:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379. [2024-10-13 02:13:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 261 states have (on average 1.3409961685823755) internal successors, (350), 262 states have internal predecessors, (350), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-13 02:13:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 572 transitions. [2024-10-13 02:13:42,478 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 572 transitions. Word has length 164 [2024-10-13 02:13:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:42,479 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 572 transitions. [2024-10-13 02:13:42,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:13:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 572 transitions. [2024-10-13 02:13:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 02:13:42,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:42,480 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:42,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:13:42,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:42,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash -47803458, now seen corresponding path program 1 times [2024-10-13 02:13:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:42,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14587020] [2024-10-13 02:13:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:42,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:13:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:13:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:13:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:13:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:13:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:13:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:13:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:13:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:13:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:13:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:13:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:13:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:13:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:13:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:13:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:13:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:13:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:13:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:13:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:13:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:13:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:13:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:13:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:13:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:13:42,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:13:42,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14587020] [2024-10-13 02:13:42,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14587020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:13:42,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:13:42,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:13:42,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583996436] [2024-10-13 02:13:42,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:13:42,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:13:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:13:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:13:42,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:13:42,625 INFO L87 Difference]: Start difference. First operand 379 states and 572 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:42,662 INFO L93 Difference]: Finished difference Result 631 states and 956 transitions. [2024-10-13 02:13:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:13:42,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2024-10-13 02:13:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:42,665 INFO L225 Difference]: With dead ends: 631 [2024-10-13 02:13:42,665 INFO L226 Difference]: Without dead ends: 379 [2024-10-13 02:13:42,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-10-13 02:13:42,667 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:42,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:13:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-13 02:13:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-10-13 02:13:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 261 states have (on average 1.3371647509578544) internal successors, (349), 262 states have internal predecessors, (349), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-13 02:13:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 571 transitions. [2024-10-13 02:13:42,712 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 571 transitions. Word has length 164 [2024-10-13 02:13:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:42,713 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 571 transitions. [2024-10-13 02:13:42,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:13:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 571 transitions. [2024-10-13 02:13:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 02:13:42,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:42,715 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:42,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:13:42,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:42,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash -350547014, now seen corresponding path program 1 times [2024-10-13 02:13:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:42,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131490168] [2024-10-13 02:13:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:13:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:13:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:13:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:13:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:13:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:13:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:13:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:13:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:13:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:13:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:13:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:13:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:13:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:13:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:13:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:13:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:13:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:13:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:13:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:13:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:13:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:13:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:13:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:13:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 02:13:42,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:13:42,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131490168] [2024-10-13 02:13:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131490168] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:13:42,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996399264] [2024-10-13 02:13:42,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:42,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:13:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:13:43,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:13:43,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:13:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:43,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 02:13:43,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:13:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-13 02:13:43,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:13:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 02:13:43,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996399264] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:13:43,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:13:43,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2024-10-13 02:13:43,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98239585] [2024-10-13 02:13:43,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:13:43,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 02:13:43,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:13:43,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 02:13:43,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-13 02:13:43,891 INFO L87 Difference]: Start difference. First operand 379 states and 571 transitions. Second operand has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-13 02:13:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:44,843 INFO L93 Difference]: Finished difference Result 595 states and 886 transitions. [2024-10-13 02:13:44,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 02:13:44,843 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 165 [2024-10-13 02:13:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:44,855 INFO L225 Difference]: With dead ends: 595 [2024-10-13 02:13:44,855 INFO L226 Difference]: Without dead ends: 282 [2024-10-13 02:13:44,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2024-10-13 02:13:44,857 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 575 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:44,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 589 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 02:13:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-13 02:13:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 162. [2024-10-13 02:13:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 107 states have internal predecessors, (133), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:13:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 229 transitions. [2024-10-13 02:13:44,886 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 229 transitions. Word has length 165 [2024-10-13 02:13:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:44,887 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 229 transitions. [2024-10-13 02:13:44,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-13 02:13:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 229 transitions. [2024-10-13 02:13:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 02:13:44,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:44,888 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:44,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:13:45,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:13:45,090 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:45,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1112586807, now seen corresponding path program 1 times [2024-10-13 02:13:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:45,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378809502] [2024-10-13 02:13:45,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:45,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:13:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:13:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:13:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:13:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:13:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:13:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:13:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:13:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:13:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:13:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:13:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:13:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:13:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:13:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:13:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:13:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:13:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:13:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:13:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:13:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:13:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:13:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:13:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:13:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 02:13:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:13:45,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378809502] [2024-10-13 02:13:45,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378809502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:13:45,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375725074] [2024-10-13 02:13:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:45,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:13:45,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:13:45,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:13:45,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:13:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:45,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 02:13:45,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:13:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-13 02:13:45,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:13:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 02:13:46,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375725074] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:13:46,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:13:46,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2024-10-13 02:13:46,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045168341] [2024-10-13 02:13:46,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:13:46,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 02:13:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:13:46,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 02:13:46,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-13 02:13:46,256 INFO L87 Difference]: Start difference. First operand 162 states and 229 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-13 02:13:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:47,100 INFO L93 Difference]: Finished difference Result 286 states and 404 transitions. [2024-10-13 02:13:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 02:13:47,100 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 166 [2024-10-13 02:13:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:47,102 INFO L225 Difference]: With dead ends: 286 [2024-10-13 02:13:47,102 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 02:13:47,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2024-10-13 02:13:47,103 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 257 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:47,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 762 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 02:13:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 02:13:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2024-10-13 02:13:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.233644859813084) internal successors, (132), 107 states have internal predecessors, (132), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:13:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 228 transitions. [2024-10-13 02:13:47,125 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 228 transitions. Word has length 166 [2024-10-13 02:13:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:47,126 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 228 transitions. [2024-10-13 02:13:47,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-13 02:13:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 228 transitions. [2024-10-13 02:13:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:13:47,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:47,127 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:13:47,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:13:47,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 02:13:47,328 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:47,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2083815520, now seen corresponding path program 1 times [2024-10-13 02:13:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:13:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134597297] [2024-10-13 02:13:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:13:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:13:47,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125266228] [2024-10-13 02:13:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:47,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:13:47,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:13:47,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:13:47,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 02:13:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:13:47,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:13:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:13:47,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:13:47,677 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:13:47,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:13:47,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:13:47,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:13:47,883 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:13:47,978 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:13:47,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:13:47 BoogieIcfgContainer [2024-10-13 02:13:47,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:13:47,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:13:47,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:13:47,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:13:47,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:13:37" (3/4) ... [2024-10-13 02:13:47,984 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:13:47,985 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:13:47,985 INFO L158 Benchmark]: Toolchain (without parser) took 11173.98ms. Allocated memory was 144.7MB in the beginning and 314.6MB in the end (delta: 169.9MB). Free memory was 89.3MB in the beginning and 229.3MB in the end (delta: -140.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-10-13 02:13:47,985 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 144.7MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:13:47,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.94ms. Allocated memory is still 144.7MB. Free memory was 89.3MB in the beginning and 72.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 02:13:47,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.40ms. Allocated memory is still 144.7MB. Free memory was 72.5MB in the beginning and 69.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:13:47,986 INFO L158 Benchmark]: Boogie Preprocessor took 63.45ms. Allocated memory is still 144.7MB. Free memory was 69.0MB in the beginning and 65.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:13:47,986 INFO L158 Benchmark]: RCFGBuilder took 676.45ms. Allocated memory was 144.7MB in the beginning and 218.1MB in the end (delta: 73.4MB). Free memory was 65.4MB in the beginning and 186.0MB in the end (delta: -120.6MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2024-10-13 02:13:47,986 INFO L158 Benchmark]: TraceAbstraction took 10059.46ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 186.0MB in the beginning and 229.3MB in the end (delta: -43.3MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-10-13 02:13:47,986 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 314.6MB. Free memory is still 229.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:13:47,987 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.16ms. Allocated memory is still 144.7MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.94ms. Allocated memory is still 144.7MB. Free memory was 89.3MB in the beginning and 72.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.40ms. Allocated memory is still 144.7MB. Free memory was 72.5MB in the beginning and 69.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.45ms. Allocated memory is still 144.7MB. Free memory was 69.0MB in the beginning and 65.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 676.45ms. Allocated memory was 144.7MB in the beginning and 218.1MB in the end (delta: 73.4MB). Free memory was 65.4MB in the beginning and 186.0MB in the end (delta: -120.6MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10059.46ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 186.0MB in the beginning and 229.3MB in the end (delta: -43.3MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 314.6MB. Free memory is still 229.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 someBinaryFLOATComparisonOperation at line 177, overapproximation of bitwiseOr at line 85, overapproximation of someUnaryDOUBLEoperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someUnaryFLOAToperation at line 95, overapproximation of someBinaryArithmeticFLOAToperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_28 = 64; [L44] float var_1_33 = 10.775; [L45] unsigned long int var_1_41 = 256; [L46] unsigned long int var_1_45 = 64; [L47] double var_1_46 = 31.1; [L48] signed char var_1_47 = 50; [L49] signed char var_1_48 = 16; [L50] double last_1_var_1_22 = 200.8; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L174] last_1_var_1_22 = var_1_22 [L184] RET updateLastVariables() [L185] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L134] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L136] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L137] var_1_6 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L138] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L140] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L143] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L146] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L152] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L154] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L156] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L158] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L159] var_1_23 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L160] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L162] var_1_24 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L163] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L165] var_1_28 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L166] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L169] var_1_48 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_48 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L170] RET assume_abort_if_not(var_1_48 >= -127) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] CALL assume_abort_if_not(var_1_48 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] RET assume_abort_if_not(var_1_48 <= 126) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L185] RET updateVariables() [L186] CALL step() [L54] COND TRUE ! (var_1_4 < 16.8f) [L55] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L57] EXPR var_1_25 ^ (var_1_28 + var_1_24) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L57] COND TRUE (var_1_25 ^ (var_1_28 + var_1_24)) <= (((((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) < 0 ) ? -((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) : ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))))) [L58] var_1_33 = (((((((((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) < (var_1_18)) ? (((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) : (var_1_18))) < 0 ) ? -((((((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) < (var_1_18)) ? (((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) : (var_1_18))) : ((((((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) < (var_1_18)) ? (((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) : (var_1_18))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L66] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L75] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L76] EXPR var_1_25 & var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L76] COND TRUE (var_1_25 & var_1_25) <= var_1_25 [L77] COND FALSE !(var_1_19 <= var_1_5) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L86] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L94] COND TRUE var_1_24 != var_1_25 [L95] var_1_46 = ((((((((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) < 0 ) ? -((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) : ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) < 0 ) ? -(((((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) < 0 ) ? -((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) : ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : (((((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) < 0 ) ? -((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) : ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L99] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L102] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L103] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L108] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L109] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L116] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_20=5, var_1_21=1, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L118] var_1_45 = var_1_23 [L119] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_20=5, var_1_21=1, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L120] COND TRUE stepLocal_0 || var_1_7 [L121] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=1, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L123] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L124] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L126] COND TRUE (var_1_25 % var_1_28) >= var_1_25 [L127] var_1_26 = (var_1_7 || var_1_11) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=1, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=1, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L177-L178] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=1, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=1, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 10, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1782 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1735 mSDsluCounter, 3964 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2651 mSDsCounter, 628 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3050 IncrementalHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 628 mSolverCounterUnsat, 1313 mSDtfsCounter, 3050 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1199 GetRequests, 1121 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred in iteration=6, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 205 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2139 NumberOfCodeBlocks, 2139 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2117 ConstructedInterpolants, 0 QuantifiedInterpolants, 4629 SizeOfPredicates, 3 NumberOfNonLiveVariables, 758 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 14208/14352 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-10-13 02:13:48,035 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.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 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:13:50,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:13:50,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:13:50,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:13:50,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:13:50,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:13:50,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:13:50,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:13:50,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:13:50,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:13:50,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:13:50,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:13:50,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:13:50,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:13:50,230 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:13:50,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:13:50,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:13:50,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:13:50,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:13:50,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:13:50,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:13:50,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:13:50,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:13:50,233 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:13:50,233 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:13:50,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:13:50,234 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:13:50,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:13:50,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:13:50,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:13:50,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:13:50,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:13:50,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:13:50,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:13:50,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:13:50,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:13:50,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:13:50,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:13:50,244 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:13:50,244 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:13:50,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:13:50,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:13:50,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:13:50,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:13:50,246 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:13:50,246 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 -> 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 [2024-10-13 02:13:50,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:13:50,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:13:50,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:13:50,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:13:50,561 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:13:50,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-13 02:13:51,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:13:52,124 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:13:52,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-13 02:13:52,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c33860e5/1067ff919721495a832028aea00fc508/FLAGe67e6a2ca [2024-10-13 02:13:52,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c33860e5/1067ff919721495a832028aea00fc508 [2024-10-13 02:13:52,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:13:52,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:13:52,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:13:52,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:13:52,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:13:52,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6e538f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52, skipping insertion in model container [2024-10-13 02:13:52,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:13:52,702 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-75.i[919,932] [2024-10-13 02:13:52,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:13:52,802 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:13:52,813 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-75.i[919,932] [2024-10-13 02:13:52,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:13:52,857 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:13:52,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52 WrapperNode [2024-10-13 02:13:52,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:13:52,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:13:52,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:13:52,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:13:52,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,919 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-13 02:13:52,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:13:52,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:13:52,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:13:52,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:13:52,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,962 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-10-13 02:13:52,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:13:52,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:13:52,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:13:52,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:13:52,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (1/1) ... [2024-10-13 02:13:52,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:13:53,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:13:53,023 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-10-13 02:13:53,026 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-10-13 02:13:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:13:53,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:13:53,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:13:53,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:13:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:13:53,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:13:53,155 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:13:53,157 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:14:18,244 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 02:14:18,244 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:14:18,308 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:14:18,308 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:14:18,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:18 BoogieIcfgContainer [2024-10-13 02:14:18,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:14:18,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:14:18,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:14:18,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:14:18,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:13:52" (1/3) ... [2024-10-13 02:14:18,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7176ccbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:14:18, skipping insertion in model container [2024-10-13 02:14:18,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:13:52" (2/3) ... [2024-10-13 02:14:18,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7176ccbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:14:18, skipping insertion in model container [2024-10-13 02:14:18,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:18" (3/3) ... [2024-10-13 02:14:18,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-13 02:14:18,335 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:14:18,335 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:14:18,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:14:18,408 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;@16239e98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:14:18,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:14:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:14:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 02:14:18,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:18,428 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:14:18,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1248243038, now seen corresponding path program 1 times [2024-10-13 02:14:18,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:14:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049857331] [2024-10-13 02:14:18,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:18,449 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-10-13 02:14:18,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:14:18,452 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-10-13 02:14:18,453 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-10-13 02:14:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:19,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:14:19,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:14:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-10-13 02:14:19,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:14:19,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:14:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049857331] [2024-10-13 02:14:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049857331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:19,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:14:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84184789] [2024-10-13 02:14:19,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:19,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:14:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:14:19,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:14:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:14:19,261 INFO L87 Difference]: Start difference. First operand has 75 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:14:23,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:14:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:23,557 INFO L93 Difference]: Finished difference Result 147 states and 264 transitions. [2024-10-13 02:14:23,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:14:23,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 154 [2024-10-13 02:14:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:23,639 INFO L225 Difference]: With dead ends: 147 [2024-10-13 02:14:23,639 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 02:14:23,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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-10-13 02:14:23,644 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:23,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 02:14:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 02:14:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-13 02:14:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:14:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2024-10-13 02:14:23,685 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 154 [2024-10-13 02:14:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:23,685 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2024-10-13 02:14:23,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:14:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2024-10-13 02:14:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:14:23,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:23,688 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 02:14:23,711 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 (2)] Ended with exit code 0 [2024-10-13 02:14:23,888 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-10-13 02:14:23,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:23,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:23,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2101981347, now seen corresponding path program 1 times [2024-10-13 02:14:23,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:14:23,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301288379] [2024-10-13 02:14:23,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:23,891 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-10-13 02:14:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:14:23,894 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-10-13 02:14:23,896 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-10-13 02:14:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:24,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 02:14:24,794 INFO L278 TraceCheckSpWp]: Computing forward predicates...