./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_operatoramount_amount25_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:39:01,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:39:01,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:39:01,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:39:01,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:39:01,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:39:01,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:39:01,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:39:01,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:39:01,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:39:01,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:39:01,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:39:01,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:39:01,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:39:01,391 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:39:01,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:39:01,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:39:01,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:39:01,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:39:01,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:39:01,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:39:01,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:39:01,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:39:01,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:39:01,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:39:01,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:39:01,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:39:01,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:39:01,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:39:01,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:39:01,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:39:01,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:39:01,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:01,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:39:01,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:39:01,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:39:01,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:39:01,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:39:01,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:39:01,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:39:01,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:39:01,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:39:01,403 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-clean/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-clean/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 -> c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 [2024-10-11 12:39:01,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:39:01,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:39:01,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:39:01,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:39:01,697 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:39:01,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2024-10-11 12:39:03,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:39:03,302 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:39:03,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2024-10-11 12:39:03,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07d3f3ff5/4d2e0869dc874355b4710df4642dbe29/FLAG6c82e68b8 [2024-10-11 12:39:03,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07d3f3ff5/4d2e0869dc874355b4710df4642dbe29 [2024-10-11 12:39:03,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:39:03,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:39:03,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:03,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:39:03,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:39:03,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:03,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c68198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03, skipping insertion in model container [2024-10-11 12:39:03,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:03,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:39:03,874 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_operatoramount_amount25_file-72.i[915,928] [2024-10-11 12:39:03,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:03,930 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:39:03,945 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_operatoramount_amount25_file-72.i[915,928] [2024-10-11 12:39:03,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:03,993 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:39:03,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03 WrapperNode [2024-10-11 12:39:03,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:03,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:03,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:39:03,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:39:04,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,046 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-10-11 12:39:04,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:04,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:39:04,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:39:04,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:39:04,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,077 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-11 12:39:04,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:39:04,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:39:04,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:39:04,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:39:04,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (1/1) ... [2024-10-11 12:39:04,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:04,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:39:04,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:39:04,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:39:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:39:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:39:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:39:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:39:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:39:04,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:39:04,332 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:39:04,334 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:39:04,566 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:39:04,567 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:39:04,625 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:39:04,625 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:39:04,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:04 BoogieIcfgContainer [2024-10-11 12:39:04,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:39:04,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:39:04,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:39:04,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:39:04,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:39:03" (1/3) ... [2024-10-11 12:39:04,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d3c1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:04, skipping insertion in model container [2024-10-11 12:39:04,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:03" (2/3) ... [2024-10-11 12:39:04,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d3c1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:04, skipping insertion in model container [2024-10-11 12:39:04,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:04" (3/3) ... [2024-10-11 12:39:04,635 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-72.i [2024-10-11 12:39:04,652 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:39:04,653 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:39:04,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:39:04,729 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;@742e7e59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:39:04,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:39:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 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-11 12:39:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:39:04,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:04,743 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] [2024-10-11 12:39:04,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:04,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash 499470738, now seen corresponding path program 1 times [2024-10-11 12:39:04,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:39:04,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373043292] [2024-10-11 12:39:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:04,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:39:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:39:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:39:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:39:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 12:39:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 12:39:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 12:39:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 12:39:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 12:39:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 12:39:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:39:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 12:39:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:39:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 12:39:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:39:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 12:39:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:39:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 12:39:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 12:39:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 12:39:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 12:39:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 12:39:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 12:39:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 12:39:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,173 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-11 12:39:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:39:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373043292] [2024-10-11 12:39:05,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373043292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:39:05,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:39:05,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:39:05,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620773578] [2024-10-11 12:39:05,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:39:05,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:39:05,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:39:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:39:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:39:05,207 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 12:39:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:05,241 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions. [2024-10-11 12:39:05,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:39:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2024-10-11 12:39:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:05,254 INFO L225 Difference]: With dead ends: 109 [2024-10-11 12:39:05,254 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 12:39:05,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-11 12:39:05,264 INFO L432 NwaCegarLoop]: 77 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, 77 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-11 12:39:05,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:39:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 12:39:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 12:39:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-11 12:39:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2024-10-11 12:39:05,315 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 139 [2024-10-11 12:39:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:05,316 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2024-10-11 12:39:05,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 12:39:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2024-10-11 12:39:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:39:05,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:05,320 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] [2024-10-11 12:39:05,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:39:05,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:05,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash -617113440, now seen corresponding path program 1 times [2024-10-11 12:39:05,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:39:05,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621212491] [2024-10-11 12:39:05,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:39:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:39:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:39:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:39:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 12:39:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 12:39:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 12:39:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 12:39:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 12:39:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 12:39:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:39:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 12:39:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:39:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 12:39:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:39:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 12:39:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:39:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 12:39:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 12:39:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 12:39:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 12:39:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 12:39:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 12:39:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 12:39:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 12:39:05,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:39:05,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621212491] [2024-10-11 12:39:05,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621212491] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:39:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72843679] [2024-10-11 12:39:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:05,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:39:05,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:39:06,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:39:06,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:39:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:06,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 12:39:06,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:39:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 12:39:06,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:39:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 12:39:06,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72843679] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:39:06,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:39:06,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 12:39:06,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007688652] [2024-10-11 12:39:06,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:39:06,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:39:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:39:06,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:39:06,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:39:06,693 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 12:39:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:06,937 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2024-10-11 12:39:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:39:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 139 [2024-10-11 12:39:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:06,941 INFO L225 Difference]: With dead ends: 115 [2024-10-11 12:39:06,941 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 12:39:06,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 319 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:39:06,946 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 72 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:39:06,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 101 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:39:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 12:39:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2024-10-11 12:39:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 12:39:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2024-10-11 12:39:06,967 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 139 [2024-10-11 12:39:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:06,968 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2024-10-11 12:39:06,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 12:39:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2024-10-11 12:39:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:39:06,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:06,971 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] [2024-10-11 12:39:06,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:39:07,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:39:07,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1157893922, now seen corresponding path program 1 times [2024-10-11 12:39:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:39:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855868372] [2024-10-11 12:39:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:07,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:39:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:39:07,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:39:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:39:07,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:39:07,356 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:39:07,357 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:39:07,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:39:07,363 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:39:07,466 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:39:07,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:39:07 BoogieIcfgContainer [2024-10-11 12:39:07,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:39:07,474 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:39:07,474 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:39:07,474 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:39:07,475 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:04" (3/4) ... [2024-10-11 12:39:07,477 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:39:07,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:39:07,479 INFO L158 Benchmark]: Toolchain (without parser) took 3793.16ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 98.6MB in the beginning and 132.7MB in the end (delta: -34.2MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-11 12:39:07,479 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:39:07,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.17ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 84.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:39:07,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.66ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 81.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:39:07,480 INFO L158 Benchmark]: Boogie Preprocessor took 49.47ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 79.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:39:07,480 INFO L158 Benchmark]: RCFGBuilder took 528.33ms. Allocated memory is still 167.8MB. Free memory was 79.2MB in the beginning and 119.7MB in the end (delta: -40.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-11 12:39:07,481 INFO L158 Benchmark]: TraceAbstraction took 2845.49ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 119.0MB in the beginning and 133.8MB in the end (delta: -14.7MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-10-11 12:39:07,481 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 216.0MB. Free memory was 133.8MB in the beginning and 132.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:39:07,483 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.17ms. Allocated memory is still 167.8MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.17ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 84.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.66ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 81.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.47ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 79.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.33ms. Allocated memory is still 167.8MB. Free memory was 79.2MB in the beginning and 119.7MB in the end (delta: -40.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2845.49ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 119.0MB in the beginning and 133.8MB in the end (delta: -14.7MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 216.0MB. Free memory was 133.8MB in the beginning and 132.7MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 128.875; [L24] double var_1_3 = 24.5; [L25] double var_1_4 = 8.2; [L26] double var_1_5 = 10.05; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned long int var_1_10 = 2; [L32] signed char var_1_11 = -16; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = 4; [L36] double var_1_15 = 256.4; [L37] float var_1_16 = 0.25; [L38] double var_1_17 = 100000000000.2; [L39] double var_1_18 = 50.5; [L40] double var_1_19 = 9.5; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L63] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L64] var_1_4 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L65] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] var_1_5 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L80] var_1_12 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L86] var_1_14 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L89] var_1_16 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L92] var_1_17 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L94] var_1_18 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L96] var_1_19 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L47] var_1_11 = (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14)))) VAL [isInitial=1, var_1_10=2, var_1_11=-1, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L48] COND FALSE !((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) VAL [isInitial=1, var_1_10=2, var_1_11=-1, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L55] COND TRUE var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15) [L56] var_1_1 = (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=-1, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15)) ? (var_1_1 == ((unsigned char) (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)))) : 1) && (var_1_9 ? (var_1_10 == ((unsigned long int) 2u)) : 1)) && (var_1_11 == ((signed char) (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14))))))) && (((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) ? ((var_1_3 >= var_1_4) ? (var_1_15 == ((double) (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))))) : (var_1_15 == ((double) var_1_17))) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=-1, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=-1, var_1_12=-63, var_1_13=62, var_1_14=0, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 127 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 1228 SizeOfPredicates, 2 NumberOfNonLiveVariables, 303 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3949/4048 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-11 12:39:07,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:39:09,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:39:09,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:39:09,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:39:09,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:39:09,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:39:09,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:39:09,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:39:09,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:39:09,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:39:09,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:39:09,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:39:09,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:39:09,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:39:09,810 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:39:09,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:39:09,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:39:09,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:39:09,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:39:09,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:39:09,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:39:09,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:39:09,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:39:09,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:39:09,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:39:09,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:39:09,817 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:39:09,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:39:09,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:39:09,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:39:09,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:39:09,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:39:09,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:39:09,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:39:09,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:09,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:39:09,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:39:09,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:39:09,821 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:39:09,821 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:39:09,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:39:09,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:39:09,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:39:09,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:39:09,822 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:39:09,823 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-clean/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-clean/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 -> c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 [2024-10-11 12:39:10,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:39:10,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:39:10,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:39:10,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:39:10,174 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:39:10,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2024-10-11 12:39:11,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:39:11,962 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:39:11,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2024-10-11 12:39:11,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/04cd17674/53b3f1d4d74646d3b1600304b8c7f57f/FLAG31b862048 [2024-10-11 12:39:12,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/04cd17674/53b3f1d4d74646d3b1600304b8c7f57f [2024-10-11 12:39:12,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:39:12,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:39:12,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:12,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:39:12,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:39:12,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af273cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12, skipping insertion in model container [2024-10-11 12:39:12,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:39:12,576 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_operatoramount_amount25_file-72.i[915,928] [2024-10-11 12:39:12,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:12,662 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:39:12,674 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_operatoramount_amount25_file-72.i[915,928] [2024-10-11 12:39:12,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:12,730 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:39:12,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12 WrapperNode [2024-10-11 12:39:12,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:12,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:12,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:39:12,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:39:12,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,791 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-11 12:39:12,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:12,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:39:12,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:39:12,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:39:12,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,832 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-11 12:39:12,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:39:12,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:39:12,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:39:12,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:39:12,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (1/1) ... [2024-10-11 12:39:12,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:12,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:39:12,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:39:12,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:39:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:39:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:39:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:39:12,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:39:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:39:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:39:13,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:39:13,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:39:26,307 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:39:26,307 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:39:26,363 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:39:26,363 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:39:26,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:26 BoogieIcfgContainer [2024-10-11 12:39:26,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:39:26,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:39:26,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:39:26,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:39:26,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:39:12" (1/3) ... [2024-10-11 12:39:26,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0c24de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:26, skipping insertion in model container [2024-10-11 12:39:26,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:12" (2/3) ... [2024-10-11 12:39:26,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0c24de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:26, skipping insertion in model container [2024-10-11 12:39:26,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:26" (3/3) ... [2024-10-11 12:39:26,373 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-72.i [2024-10-11 12:39:26,386 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:39:26,386 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:39:26,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:39:26,439 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;@636f2c64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:39:26,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:39:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 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-11 12:39:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:39:26,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:26,463 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] [2024-10-11 12:39:26,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:26,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash 499470738, now seen corresponding path program 1 times [2024-10-11 12:39:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:39:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415775624] [2024-10-11 12:39:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:26,480 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-11 12:39:26,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:39:26,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 12:39:26,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:39:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:27,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:39:27,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:39:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-10-11 12:39:27,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:39:27,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:39:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415775624] [2024-10-11 12:39:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415775624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:39:27,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:39:27,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:39:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198927140] [2024-10-11 12:39:27,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:39:27,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:39:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:39:27,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:39:27,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:39:27,666 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 12:39:32,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:39:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:32,074 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions. [2024-10-11 12:39:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:39:32,188 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2024-10-11 12:39:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:32,194 INFO L225 Difference]: With dead ends: 109 [2024-10-11 12:39:32,194 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 12:39:32,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-11 12:39:32,199 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:39:32,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 12:39:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 12:39:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 12:39:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-11 12:39:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2024-10-11 12:39:32,237 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 139 [2024-10-11 12:39:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:32,238 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2024-10-11 12:39:32,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 12:39:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2024-10-11 12:39:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:39:32,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:32,241 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] [2024-10-11 12:39:32,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 12:39:32,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:32,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -617113440, now seen corresponding path program 1 times [2024-10-11 12:39:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:39:32,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24998319] [2024-10-11 12:39:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:32,445 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-11 12:39:32,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:39:32,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 12:39:32,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:39:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:33,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:39:33,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:39:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 12:39:36,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:39:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 12:39:40,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:39:40,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24998319] [2024-10-11 12:39:40,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24998319] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:39:40,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:39:40,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 12:39:40,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974615012] [2024-10-11 12:39:40,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:39:40,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:39:40,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:39:40,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:39:40,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:39:40,380 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 12:39:49,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:39:53,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:39:57,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:39:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:57,150 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2024-10-11 12:39:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:39:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 139 [2024-10-11 12:39:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:57,309 INFO L225 Difference]: With dead ends: 115 [2024-10-11 12:39:57,309 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 12:39:57,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:39:57,312 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:39:57,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 100 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2024-10-11 12:39:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 12:39:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2024-10-11 12:39:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 12:39:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2024-10-11 12:39:57,331 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 139 [2024-10-11 12:39:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:57,332 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2024-10-11 12:39:57,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 12:39:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2024-10-11 12:39:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:39:57,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:57,337 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] [2024-10-11 12:39:57,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:39:57,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:57,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:57,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1157893922, now seen corresponding path program 1 times [2024-10-11 12:39:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:39:57,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615343426] [2024-10-11 12:39:57,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:57,541 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-11 12:39:57,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:39:57,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 12:39:57,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:39:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:58,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:39:58,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:40:15,925 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 12:40:24,272 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 12:40:32,462 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)