./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-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-46.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 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:37:39,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:37:39,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:37:39,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:37:39,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:37:39,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:37:39,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:37:39,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:37:39,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:37:39,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:37:39,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:37:39,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:37:39,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:37:39,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:37:39,630 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:37:39,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:37:39,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:37:39,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:37:39,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:37:39,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:37:39,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:37:39,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:37:39,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:37:39,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:37:39,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:37:39,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:37:39,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:37:39,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:37:39,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:37:39,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:37:39,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:37:39,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:37:39,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:37:39,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:37:39,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:37:39,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:37:39,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:37:39,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:37:39,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:37:39,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:37:39,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:37:39,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:37:39,640 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 -> 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 [2024-10-14 09:37:39,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:37:39,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:37:39,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:37:39,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:37:39,905 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:37:39,906 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-46.i [2024-10-14 09:37:41,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:37:41,430 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:37:41,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i [2024-10-14 09:37:41,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6696c2af/ece5c0abd9654f6cb952ad73f212e773/FLAG79ac9bf2f [2024-10-14 09:37:41,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6696c2af/ece5c0abd9654f6cb952ad73f212e773 [2024-10-14 09:37:41,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:37:41,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:37:41,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:37:41,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:37:41,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:37:41,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ae65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41, skipping insertion in model container [2024-10-14 09:37:41,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:37:41,619 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-46.i[919,932] [2024-10-14 09:37:41,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:37:41,686 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:37:41,706 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-46.i[919,932] [2024-10-14 09:37:41,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:37:41,770 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:37:41,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41 WrapperNode [2024-10-14 09:37:41,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:37:41,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:37:41,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:37:41,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:37:41,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,839 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-10-14 09:37:41,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:37:41,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:37:41,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:37:41,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:37:41,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,935 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-14 09:37:41,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:37:41,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:37:41,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:37:41,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:37:41,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (1/1) ... [2024-10-14 09:37:41,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:37:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:37:41,997 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-14 09:37:42,009 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-14 09:37:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:37:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:37:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:37:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:37:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:37:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:37:42,110 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:37:42,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:37:42,462 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-14 09:37:42,463 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:37:42,497 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:37:42,498 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:37:42,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:37:42 BoogieIcfgContainer [2024-10-14 09:37:42,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:37:42,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:37:42,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:37:42,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:37:42,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:37:41" (1/3) ... [2024-10-14 09:37:42,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215a75b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:37:42, skipping insertion in model container [2024-10-14 09:37:42,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:41" (2/3) ... [2024-10-14 09:37:42,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215a75b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:37:42, skipping insertion in model container [2024-10-14 09:37:42,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:37:42" (3/3) ... [2024-10-14 09:37:42,506 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i [2024-10-14 09:37:42,524 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:37:42,524 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:37:42,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:37:42,584 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;@5ad906fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:37:42,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:37:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 60 states have internal predecessors, (90), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 09:37:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 09:37:42,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:42,604 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:42,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:42,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1948999979, now seen corresponding path program 1 times [2024-10-14 09:37:42,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:42,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727789891] [2024-10-14 09:37:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:42,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:37:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:37:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:37:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:37:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:37:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:37:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:37:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:37:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:37:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:37:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:37:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:37:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:37:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:37:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:37:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:37:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:37:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:37:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:37:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:37:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:42,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:37:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:43,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:37:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:43,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:37:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 09:37:43,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:37:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727789891] [2024-10-14 09:37:43,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727789891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:43,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:43,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:37:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064090697] [2024-10-14 09:37:43,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:43,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:37:43,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:37:43,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:37:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:37:43,033 INFO L87 Difference]: Start difference. First operand has 85 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 60 states have internal predecessors, (90), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 09:37:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:43,059 INFO L93 Difference]: Finished difference Result 167 states and 293 transitions. [2024-10-14 09:37:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:37:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 149 [2024-10-14 09:37:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:43,085 INFO L225 Difference]: With dead ends: 167 [2024-10-14 09:37:43,085 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 09:37:43,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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-14 09:37:43,090 INFO L432 NwaCegarLoop]: 127 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, 127 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-14 09:37:43,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:37:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 09:37:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-14 09:37:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 09:37:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-10-14 09:37:43,136 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 149 [2024-10-14 09:37:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:43,137 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-10-14 09:37:43,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 09:37:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-10-14 09:37:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 09:37:43,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:43,140 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:43,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:37:43,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:43,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash -8525954, now seen corresponding path program 1 times [2024-10-14 09:37:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033763237] [2024-10-14 09:37:43,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:59,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:37:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:59,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:37:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:59,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:37:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:37:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:59,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:38:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:38:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:38:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:38:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:38:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:38:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:38:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:38:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:38:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:38:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:38:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:38:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:38:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:38:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:38:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:38:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:38:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:38:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:38:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 09:38:00,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:38:00,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033763237] [2024-10-14 09:38:00,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033763237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:38:00,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:38:00,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 09:38:00,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620965910] [2024-10-14 09:38:00,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:38:00,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 09:38:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:38:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 09:38:00,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:38:00,068 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 09:38:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:38:12,670 INFO L93 Difference]: Finished difference Result 377 states and 579 transitions. [2024-10-14 09:38:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 09:38:12,671 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-10-14 09:38:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:38:12,674 INFO L225 Difference]: With dead ends: 377 [2024-10-14 09:38:12,674 INFO L226 Difference]: Without dead ends: 295 [2024-10-14 09:38:12,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2024-10-14 09:38:12,676 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 905 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:38:12,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 472 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-14 09:38:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-14 09:38:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 159. [2024-10-14 09:38:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 124 states have (on average 1.5080645161290323) internal successors, (187), 125 states have internal predecessors, (187), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 09:38:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 249 transitions. [2024-10-14 09:38:12,701 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 249 transitions. Word has length 150 [2024-10-14 09:38:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:38:12,702 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 249 transitions. [2024-10-14 09:38:12,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 09:38:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 249 transitions. [2024-10-14 09:38:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 09:38:12,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:38:12,706 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:38:12,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:38:12,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:38:12,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:38:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash -826174404, now seen corresponding path program 1 times [2024-10-14 09:38:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:38:12,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372286068] [2024-10-14 09:38:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:38:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:38:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:38:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:38:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:38:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:38:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:38:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:38:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:38:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:38:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:38:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:38:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:38:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:38:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:38:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:38:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:38:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:38:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:38:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:38:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:38:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:38:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:38:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:38:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:38:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 96 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-10-14 09:38:13,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:38:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372286068] [2024-10-14 09:38:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372286068] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:38:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723205493] [2024-10-14 09:38:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:38:13,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:38:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:38:13,149 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-14 09:38:13,153 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-14 09:38:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:13,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 09:38:13,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:38:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 462 proven. 96 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-10-14 09:38:13,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:38:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 99 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-10-14 09:38:14,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723205493] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:38:14,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:38:14,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 20 [2024-10-14 09:38:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575307208] [2024-10-14 09:38:14,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:38:14,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 09:38:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:38:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 09:38:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-10-14 09:38:14,328 INFO L87 Difference]: Start difference. First operand 159 states and 249 transitions. Second operand has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 5 states have call successors, (56), 3 states have call predecessors, (56), 7 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) [2024-10-14 09:38:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:38:15,202 INFO L93 Difference]: Finished difference Result 520 states and 778 transitions. [2024-10-14 09:38:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 09:38:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 5 states have call successors, (56), 3 states have call predecessors, (56), 7 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) Word has length 150 [2024-10-14 09:38:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:38:15,207 INFO L225 Difference]: With dead ends: 520 [2024-10-14 09:38:15,207 INFO L226 Difference]: Without dead ends: 362 [2024-10-14 09:38:15,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 337 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=452, Invalid=1030, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 09:38:15,210 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 388 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:38:15,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 507 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:38:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-14 09:38:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 140. [2024-10-14 09:38:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.4821428571428572) internal successors, (166), 112 states have internal predecessors, (166), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 09:38:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 212 transitions. [2024-10-14 09:38:15,236 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 212 transitions. Word has length 150 [2024-10-14 09:38:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:38:15,236 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 212 transitions. [2024-10-14 09:38:15,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 5 states have call successors, (56), 3 states have call predecessors, (56), 7 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) [2024-10-14 09:38:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 212 transitions. [2024-10-14 09:38:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 09:38:15,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:38:15,238 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:38:15,260 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-14 09:38:15,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:38:15,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:38:15,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:38:15,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2040950143, now seen corresponding path program 1 times [2024-10-14 09:38:15,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:38:15,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742557283] [2024-10-14 09:38:15,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:38:15,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:38:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:38:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:38:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:38:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:38:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:38:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:38:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:38:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:38:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:38:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:38:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:38:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:38:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:38:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:38:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:38:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:38:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:38:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:38:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:38:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:38:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:38:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:38:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:38:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 09:38:25,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:38:25,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742557283] [2024-10-14 09:38:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742557283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:38:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:38:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 09:38:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095249764] [2024-10-14 09:38:25,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:38:25,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 09:38:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:38:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 09:38:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-14 09:38:25,902 INFO L87 Difference]: Start difference. First operand 140 states and 212 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 09:38:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:38:29,643 INFO L93 Difference]: Finished difference Result 462 states and 689 transitions. [2024-10-14 09:38:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 09:38:29,643 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-10-14 09:38:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:38:29,645 INFO L225 Difference]: With dead ends: 462 [2024-10-14 09:38:29,647 INFO L226 Difference]: Without dead ends: 323 [2024-10-14 09:38:29,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2024-10-14 09:38:29,650 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 924 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:38:29,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 335 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 09:38:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-14 09:38:29,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 156. [2024-10-14 09:38:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 128 states have (on average 1.4765625) internal successors, (189), 128 states have internal predecessors, (189), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 09:38:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 235 transitions. [2024-10-14 09:38:29,673 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 235 transitions. Word has length 151 [2024-10-14 09:38:29,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:38:29,673 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 235 transitions. [2024-10-14 09:38:29,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 09:38:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 235 transitions. [2024-10-14 09:38:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 09:38:29,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:38:29,675 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:38:29,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:38:29,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:38:29,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:38:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 565073411, now seen corresponding path program 1 times [2024-10-14 09:38:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:38:29,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386818353] [2024-10-14 09:38:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:38:29,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:38:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:38:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:38:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:38:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:38:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:38:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:38:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:38:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:38:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:38:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:38:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:38:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:38:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:38:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:38:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:38:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:38:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:38:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:38:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:38:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:38:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:38:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:38:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:38:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:38:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 09:38:48,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:38:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386818353] [2024-10-14 09:38:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386818353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:38:48,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:38:48,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 09:38:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179247672] [2024-10-14 09:38:48,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:38:48,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:38:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:38:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:38:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:38:49,002 INFO L87 Difference]: Start difference. First operand 156 states and 235 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 09:38:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:38:53,400 INFO L93 Difference]: Finished difference Result 472 states and 697 transitions. [2024-10-14 09:38:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 09:38:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-10-14 09:38:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:38:53,407 INFO L225 Difference]: With dead ends: 472 [2024-10-14 09:38:53,407 INFO L226 Difference]: Without dead ends: 317 [2024-10-14 09:38:53,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-14 09:38:53,410 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 419 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 09:38:53,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 397 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 09:38:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-14 09:38:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 158. [2024-10-14 09:38:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 130 states have (on average 1.4846153846153847) internal successors, (193), 130 states have internal predecessors, (193), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 09:38:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 239 transitions. [2024-10-14 09:38:53,435 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 239 transitions. Word has length 151 [2024-10-14 09:38:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:38:53,435 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 239 transitions. [2024-10-14 09:38:53,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 09:38:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 239 transitions. [2024-10-14 09:38:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 09:38:53,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:38:53,437 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:38:53,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:38:53,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:38:53,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:38:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1618248317, now seen corresponding path program 1 times [2024-10-14 09:38:53,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:38:53,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126171475] [2024-10-14 09:38:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:38:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:38:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:38:53,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734648616] [2024-10-14 09:38:53,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:38:53,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:38:53,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:38:53,503 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-14 09:38:53,507 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-14 09:38:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:38:53,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:38:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:38:53,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:38:53,862 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:38:53,863 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:38:53,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:38:54,066 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,SelfDestructingSolverStorable5 [2024-10-14 09:38:54,070 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 09:38:54,192 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:38:54,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:38:54 BoogieIcfgContainer [2024-10-14 09:38:54,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:38:54,199 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:38:54,199 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:38:54,199 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:38:54,200 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:37:42" (3/4) ... [2024-10-14 09:38:54,201 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:38:54,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:38:54,203 INFO L158 Benchmark]: Toolchain (without parser) took 72746.99ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 83.0MB in the beginning and 1.1GB in the end (delta: -1.1GB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:38:54,203 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:38:54,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.93ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 66.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 09:38:54,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.40ms. Allocated memory is still 155.2MB. Free memory was 66.5MB in the beginning and 60.4MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 09:38:54,205 INFO L158 Benchmark]: Boogie Preprocessor took 127.46ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 60.4MB in the beginning and 182.1MB in the end (delta: -121.8MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-14 09:38:54,208 INFO L158 Benchmark]: RCFGBuilder took 530.02ms. Allocated memory is still 218.1MB. Free memory was 182.1MB in the beginning and 146.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-14 09:38:54,208 INFO L158 Benchmark]: TraceAbstraction took 71697.80ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 145.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 699.4MB. Max. memory is 16.1GB. [2024-10-14 09:38:54,208 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 1.2GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:38:54,209 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.09ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.93ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 66.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.40ms. Allocated memory is still 155.2MB. Free memory was 66.5MB in the beginning and 60.4MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.46ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 60.4MB in the beginning and 182.1MB in the end (delta: -121.8MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * RCFGBuilder took 530.02ms. Allocated memory is still 218.1MB. Free memory was 182.1MB in the beginning and 146.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 71697.80ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 145.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 699.4MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 1.2GB. Free memory is still 1.1GB. 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 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 171. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_11 = 63.75; [L32] signed long int var_1_12 = 100000; [L33] unsigned short int var_1_13 = 8; [L34] signed long int var_1_14 = 2; [L35] signed long int var_1_15 = 32; [L36] double var_1_17 = 127.5; [L37] double var_1_18 = 32.75; [L38] signed char var_1_19 = 0; [L39] unsigned long int var_1_20 = 128; [L40] unsigned long int var_1_21 = 32; [L41] unsigned char var_1_23 = 0; [L42] unsigned char var_1_25 = 0; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_27 = 16; [L45] signed long int var_1_29 = 5; [L46] unsigned char var_1_31 = 128; [L47] signed char var_1_33 = 50; [L48] unsigned short int last_1_var_1_13 = 8; [L49] double last_1_var_1_17 = 127.5; [L175] isInitial = 1 [L176] FCALL initially() [L177] COND TRUE 1 [L178] CALL updateLastVariables() [L167] last_1_var_1_13 = var_1_13 [L168] last_1_var_1_17 = var_1_17 [L178] RET updateLastVariables() [L179] CALL updateVariables() [L130] var_1_2 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L131] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L133] var_1_3 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L134] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L135] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L135] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L137] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L139] var_1_5 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L140] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L142] var_1_7 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L143] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L144] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L145] var_1_8 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L146] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L147] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L148] var_1_11 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L149] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L150] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L150] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L151] var_1_14 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L153] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L153] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L154] var_1_15 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L156] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L156] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L157] var_1_18 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && 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_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L158] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && 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_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L162] var_1_26 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L163] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L164] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L164] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L179] RET updateVariables() [L180] CALL step() [L53] COND FALSE !(-100000 >= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L56] COND FALSE !((last_1_var_1_17 / var_1_11) == 999999.6f) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L60] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, stepLocal_0=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L61] COND TRUE var_1_2 && stepLocal_0 [L62] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L66] COND FALSE !((-25 + (var_1_15 + var_1_5)) <= var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L73] COND TRUE var_1_1 <= (var_1_5 * var_1_4) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L74] COND TRUE \read(var_1_2) [L75] var_1_6 = (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L82] var_1_21 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) [L83] var_1_17 = var_1_18 [L84] var_1_19 = 5 [L85] var_1_27 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=128, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=5, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L86] COND TRUE var_1_1 != (var_1_6 + var_1_4) [L87] var_1_29 = ((((var_1_4) > (((((((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_15)) ? (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) : (var_1_15))))) ? (var_1_4) : (((((((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_15)) ? (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=128, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L91] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L92] COND TRUE var_1_2 || (var_1_25 && var_1_2) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L93] COND TRUE var_1_6 >= var_1_14 [L94] var_1_33 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L103] COND FALSE !(var_1_1 < var_1_20) [L110] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L112] COND FALSE !(var_1_4 > var_1_6) [L117] var_1_23 = (! var_1_26) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L119] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L119] EXPR var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L119] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) [L126] var_1_13 = var_1_1 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=127, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L180] RET step() [L181] CALL, EXPR property() [L171] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=127, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L171-L172] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L181] RET, EXPR property() [L181] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=127, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=127, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=254, var_1_2=-255, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=-258, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=-32769, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.5s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2637 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2636 mSDsluCounter, 1838 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1270 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2751 IncrementalHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 568 mSDtfsCounter, 2751 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 625 GetRequests, 539 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=2, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 684 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 47.9s InterpolantComputationTime, 1203 NumberOfCodeBlocks, 1203 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1044 ConstructedInterpolants, 0 QuantifiedInterpolants, 17445 SizeOfPredicates, 7 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6793/7084 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-14 09:38:54,430 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-14 09:38:54,474 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 137 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-46.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 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:38:56,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:38:56,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:38:56,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:38:56,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:38:56,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:38:56,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:38:56,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:38:56,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:38:56,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:38:56,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:38:56,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:38:56,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:38:56,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:38:56,581 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:38:56,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:38:56,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:38:56,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:38:56,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:38:56,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:38:56,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:38:56,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:38:56,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:38:56,586 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:38:56,586 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:38:56,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:38:56,587 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:38:56,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:38:56,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:38:56,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:38:56,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:38:56,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:38:56,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:38:56,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:38:56,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:38:56,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:38:56,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:38:56,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:38:56,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:38:56,589 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:38:56,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:38:56,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:38:56,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:38:56,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:38:56,593 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:38:56,593 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 -> 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 [2024-10-14 09:38:56,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:38:56,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:38:56,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:38:56,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:38:56,901 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:38:56,903 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-46.i [2024-10-14 09:38:58,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:38:58,589 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:38:58,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i [2024-10-14 09:38:58,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa691d0d1/e5c1782531f94f829337a0ddd7d6790c/FLAGaf0f7b703 [2024-10-14 09:38:58,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa691d0d1/e5c1782531f94f829337a0ddd7d6790c [2024-10-14 09:38:58,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:38:58,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:38:58,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:38:58,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:38:58,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:38:58,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:58,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f89df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58, skipping insertion in model container [2024-10-14 09:38:58,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:58,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:38:58,789 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-46.i[919,932] [2024-10-14 09:38:58,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:38:58,846 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:38:58,855 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-46.i[919,932] [2024-10-14 09:38:58,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:38:58,933 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:38:58,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58 WrapperNode [2024-10-14 09:38:58,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:38:58,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:38:58,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:38:58,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:38:58,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:58,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:58,995 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-10-14 09:38:58,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:38:58,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:38:58,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:38:58,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:38:59,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,034 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-14 09:38:59,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:38:59,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:38:59,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:38:59,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:38:59,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (1/1) ... [2024-10-14 09:38:59,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:38:59,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:38:59,101 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-14 09:38:59,109 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-14 09:38:59,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:38:59,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:38:59,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:38:59,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:38:59,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:38:59,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:38:59,229 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:38:59,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:39:12,384 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 09:39:12,388 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:39:12,435 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:39:12,436 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:39:12,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:39:12 BoogieIcfgContainer [2024-10-14 09:39:12,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:39:12,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:39:12,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:39:12,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:39:12,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:38:58" (1/3) ... [2024-10-14 09:39:12,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436cdc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:39:12, skipping insertion in model container [2024-10-14 09:39:12,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:38:58" (2/3) ... [2024-10-14 09:39:12,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436cdc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:39:12, skipping insertion in model container [2024-10-14 09:39:12,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:39:12" (3/3) ... [2024-10-14 09:39:12,443 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i [2024-10-14 09:39:12,457 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:39:12,457 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:39:12,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:39:12,531 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;@53e9231f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:39:12,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:39:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 43 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 09:39:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 09:39:12,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:39:12,552 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:39:12,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:39:12,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:39:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1892454879, now seen corresponding path program 1 times [2024-10-14 09:39:12,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:39:12,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259738331] [2024-10-14 09:39:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:39:12,572 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-14 09:39:12,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:39:12,575 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-14 09:39:12,576 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