./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f939a31bde08313e00f5c944adf142fba63d3542c78032e0ba52b2cc30f6848 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:27:51,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:27:51,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:27:51,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:27:51,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:27:51,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:27:51,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:27:51,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:27:51,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:27:51,870 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:27:51,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:27:51,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:27:51,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:27:51,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:27:51,875 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:27:51,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:27:51,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:27:51,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:27:51,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:27:51,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:27:51,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:27:51,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:27:51,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:27:51,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:27:51,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:27:51,882 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:27:51,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:27:51,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:27:51,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:27:51,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:27:51,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:27:51,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:27:51,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:27:51,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:27:51,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:27:51,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:27:51,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:27:51,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:27:51,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:27:51,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:27:51,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:27:51,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:27:51,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f939a31bde08313e00f5c944adf142fba63d3542c78032e0ba52b2cc30f6848 [2024-11-10 06:27:52,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:27:52,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:27:52,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:27:52,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:27:52,214 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:27:52,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i [2024-11-10 06:27:53,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:27:53,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:27:53,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i [2024-11-10 06:27:53,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63fd2b54f/3b6175f8098b4411ad86f78549067fcc/FLAG7a0a5f007 [2024-11-10 06:27:54,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63fd2b54f/3b6175f8098b4411ad86f78549067fcc [2024-11-10 06:27:54,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:27:54,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:27:54,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:27:54,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:27:54,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:27:54,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37047d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54, skipping insertion in model container [2024-11-10 06:27:54,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:27:54,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i[913,926] [2024-11-10 06:27:54,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:27:54,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:27:54,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i[913,926] [2024-11-10 06:27:54,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:27:54,442 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:27:54,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54 WrapperNode [2024-11-10 06:27:54,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:27:54,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:27:54,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:27:54,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:27:54,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,512 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-10 06:27:54,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:27:54,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:27:54,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:27:54,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:27:54,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,558 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:27:54,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:27:54,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:27:54,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:27:54,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:27:54,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (1/1) ... [2024-11-10 06:27:54,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:27:54,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:27:54,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:27:54,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:27:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:27:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:27:54,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:27:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:27:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:27:54,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:27:54,781 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:27:54,783 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:27:55,203 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 06:27:55,204 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:27:55,227 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:27:55,227 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:27:55,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:27:55 BoogieIcfgContainer [2024-11-10 06:27:55,228 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:27:55,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:27:55,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:27:55,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:27:55,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:27:54" (1/3) ... [2024-11-10 06:27:55,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77951def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:27:55, skipping insertion in model container [2024-11-10 06:27:55,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:54" (2/3) ... [2024-11-10 06:27:55,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77951def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:27:55, skipping insertion in model container [2024-11-10 06:27:55,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:27:55" (3/3) ... [2024-11-10 06:27:55,241 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-12.i [2024-11-10 06:27:55,257 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:27:55,257 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:27:55,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:27:55,331 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;@45b22e61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:27:55,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:27:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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-11-10 06:27:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 06:27:55,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:27:55,358 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:27:55,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:27:55,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:27:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1163729006, now seen corresponding path program 1 times [2024-11-10 06:27:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:27:55,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231137569] [2024-11-10 06:27:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:27:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:27:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:27:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:27:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:27:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:27:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:27:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:27:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:27:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:27:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:27:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:27:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:27:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:27:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:27:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:27:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:27:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:27:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:27:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:27:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:27:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:27:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:27:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:27:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:27:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 06:27:55,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:27:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231137569] [2024-11-10 06:27:55,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231137569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:27:55,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:27:55,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:27:55,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787965871] [2024-11-10 06:27:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:27:55,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:27:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:27:55,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:27:55,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:27:55,995 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-11-10 06:27:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:27:56,027 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2024-11-10 06:27:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:27:56,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 147 [2024-11-10 06:27:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:27:56,036 INFO L225 Difference]: With dead ends: 130 [2024-11-10 06:27:56,036 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 06:27:56,040 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-11-10 06:27:56,043 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:27:56,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:27:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 06:27:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 06:27:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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-11-10 06:27:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-10 06:27:56,160 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 147 [2024-11-10 06:27:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:27:56,162 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-10 06:27:56,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-11-10 06:27:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-10 06:27:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 06:27:56,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:27:56,169 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:27:56,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:27:56,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:27:56,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:27:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 944211919, now seen corresponding path program 1 times [2024-11-10 06:27:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:27:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381891190] [2024-11-10 06:27:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:27:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:27:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:27:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:27:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:27:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:27:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:27:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:27:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:27:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:27:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:27:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:27:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:27:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:27:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:27:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:27:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:27:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:27:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:27:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:27:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:27:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:27:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:27:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:27:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:27:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 06:27:57,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:27:57,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381891190] [2024-11-10 06:27:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381891190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:27:57,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:27:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:27:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377344985] [2024-11-10 06:27:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:27:57,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:27:57,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:27:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:27:57,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:27:57,501 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 06:27:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:27:57,922 INFO L93 Difference]: Finished difference Result 188 states and 281 transitions. [2024-11-10 06:27:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:27:57,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-11-10 06:27:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:27:57,926 INFO L225 Difference]: With dead ends: 188 [2024-11-10 06:27:57,926 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 06:27:57,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:27:57,928 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 53 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:27:57,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 296 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:27:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 06:27:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2024-11-10 06:27:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 06:27:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2024-11-10 06:27:57,972 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 147 [2024-11-10 06:27:57,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:27:57,973 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2024-11-10 06:27:57,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 06:27:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2024-11-10 06:27:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 06:27:57,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:27:57,978 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:27:57,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:27:57,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:27:57,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:27:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash 756971732, now seen corresponding path program 1 times [2024-11-10 06:27:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:27:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442531294] [2024-11-10 06:27:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:27:57,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:27:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:27:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:27:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:27:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:27:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:27:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:27:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:27:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:27:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:27:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:27:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:27:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:27:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:27:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:27:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:27:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:27:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:27:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:27:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:27:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:27:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:27:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:27:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:27:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 06:27:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:27:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442531294] [2024-11-10 06:27:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442531294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:27:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335527127] [2024-11-10 06:27:58,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:27:58,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:27:58,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:27:58,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:27:58,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:27:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:27:58,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 06:27:59,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:27:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-10 06:27:59,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:27:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 06:27:59,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335527127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:27:59,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:27:59,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2024-11-10 06:27:59,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437966324] [2024-11-10 06:27:59,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:27:59,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 06:27:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:27:59,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 06:27:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-10 06:27:59,979 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-10 06:28:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:28:00,894 INFO L93 Difference]: Finished difference Result 296 states and 434 transitions. [2024-11-10 06:28:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 06:28:00,895 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) Word has length 148 [2024-11-10 06:28:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:28:00,901 INFO L225 Difference]: With dead ends: 296 [2024-11-10 06:28:00,903 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 06:28:00,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=1069, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 06:28:00,909 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 442 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 06:28:00,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 542 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 06:28:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 06:28:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 196. [2024-11-10 06:28:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 115 states have internal predecessors, (136), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-10 06:28:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 286 transitions. [2024-11-10 06:28:00,974 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 286 transitions. Word has length 148 [2024-11-10 06:28:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:28:00,975 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 286 transitions. [2024-11-10 06:28:00,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-10 06:28:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 286 transitions. [2024-11-10 06:28:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 06:28:00,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:28:00,978 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:28:01,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:28:01,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:28:01,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:28:01,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:28:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1050374739, now seen corresponding path program 1 times [2024-11-10 06:28:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:28:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219636629] [2024-11-10 06:28:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:28:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:28:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:28:01,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794219720] [2024-11-10 06:28:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:28:01,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:28:01,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:28:01,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:28:01,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 06:28:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:28:01,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:28:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:28:02,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:28:02,173 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:28:02,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:28:02,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 06:28:02,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 06:28:02,380 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 06:28:02,486 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:28:02,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:28:02 BoogieIcfgContainer [2024-11-10 06:28:02,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:28:02,490 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:28:02,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:28:02,491 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:28:02,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:27:55" (3/4) ... [2024-11-10 06:28:02,494 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:28:02,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:28:02,496 INFO L158 Benchmark]: Toolchain (without parser) took 8481.25ms. Allocated memory was 134.2MB in the beginning and 220.2MB in the end (delta: 86.0MB). Free memory was 63.7MB in the beginning and 75.5MB in the end (delta: -11.8MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2024-11-10 06:28:02,497 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 134.2MB. Free memory was 93.9MB in the beginning and 93.6MB in the end (delta: 283.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:28:02,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.34ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 63.4MB in the beginning and 151.0MB in the end (delta: -87.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-10 06:28:02,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.61ms. Allocated memory is still 182.5MB. Free memory was 151.0MB in the beginning and 147.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:28:02,499 INFO L158 Benchmark]: Boogie Preprocessor took 72.06ms. Allocated memory is still 182.5MB. Free memory was 147.8MB in the beginning and 141.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 06:28:02,500 INFO L158 Benchmark]: IcfgBuilder took 635.06ms. Allocated memory is still 182.5MB. Free memory was 141.5MB in the beginning and 118.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 06:28:02,500 INFO L158 Benchmark]: TraceAbstraction took 7257.67ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 117.4MB in the beginning and 75.5MB in the end (delta: 41.9MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2024-11-10 06:28:02,502 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 220.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:28:02,504 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.22ms. Allocated memory is still 134.2MB. Free memory was 93.9MB in the beginning and 93.6MB in the end (delta: 283.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.34ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 63.4MB in the beginning and 151.0MB in the end (delta: -87.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.61ms. Allocated memory is still 182.5MB. Free memory was 151.0MB in the beginning and 147.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.06ms. Allocated memory is still 182.5MB. Free memory was 147.8MB in the beginning and 141.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 635.06ms. Allocated memory is still 182.5MB. Free memory was 141.5MB in the beginning and 118.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7257.67ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 117.4MB in the beginning and 75.5MB in the end (delta: 41.9MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 220.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_5 = 128; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 0; [L26] signed long int var_1_8 = 128; [L27] signed long int var_1_9 = 1967984875; [L28] float var_1_10 = 256.625; [L29] float var_1_11 = 24.5; [L30] float var_1_12 = 999999.25; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 0; [L33] double var_1_15 = 127.3; [L34] float var_1_16 = 15.8; [L35] double var_1_17 = -0.4; [L36] unsigned long int var_1_18 = 8; [L37] unsigned long int var_1_19 = 2366774301; [L38] unsigned char var_1_20 = 0; [L39] signed short int var_1_21 = 5; [L40] signed char var_1_22 = 0; [L41] signed char var_1_23 = 2; [L42] unsigned char last_1_var_1_1 = 5; [L43] unsigned long int last_1_var_1_18 = 8; [L44] signed char last_1_var_1_22 = 0; VAL [isInitial=0, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=128, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L127] last_1_var_1_1 = var_1_1 [L128] last_1_var_1_18 = var_1_18 [L129] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=128, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L139] RET updateLastVariables() [L140] CALL updateVariables() [L89] var_1_5 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L90] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L91] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L91] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L94] CALL assume_abort_if_not(var_1_6 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L94] RET assume_abort_if_not(var_1_6 <= 64) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_8=128, var_1_9=1967984875] [L96] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_8=128, var_1_9=1967984875] [L97] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=1967984875] [L97] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=1967984875] [L98] var_1_9 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_9 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L99] RET assume_abort_if_not(var_1_9 >= 1073741822) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L100] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L100] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L101] var_1_11 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L102] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L103] var_1_12 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L104] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L105] var_1_13 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L106] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L107] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L107] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L108] var_1_14 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L109] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L110] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L110] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L111] var_1_16 = __VERIFIER_nondet_float() [L112] 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, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L112] 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, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L113] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L113] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L114] var_1_17 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L115] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L116] var_1_19 = __VERIFIER_nondet_ulong() [L117] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L117] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L118] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L118] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L119] var_1_20 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L121] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L121] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L122] var_1_23 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_23 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L123] RET assume_abort_if_not(var_1_23 >= -63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L124] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L124] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L140] RET updateVariables() [L141] CALL step() [L48] unsigned char stepLocal_2 = var_1_9 >= last_1_var_1_22; [L49] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_1=5, stepLocal_2=1, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L50] COND FALSE !(stepLocal_1 > last_1_var_1_18) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_2=1, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L53] COND TRUE var_1_20 || stepLocal_2 [L54] var_1_18 = var_1_6 VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L59] COND TRUE last_1_var_1_1 > (var_1_18 * var_1_18) [L60] var_1_1 = (var_1_5 - (var_1_6 + var_1_7)) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L64] var_1_21 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) [L65] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_0=-254, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L66] COND TRUE (- var_1_18) > stepLocal_0 [L67] var_1_8 = ((var_1_9 - var_1_21) - var_1_5) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L69] signed long int stepLocal_3 = var_1_8; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_3=2147483330, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L70] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L77] COND TRUE var_1_8 != ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))) [L78] var_1_10 = ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L84] COND TRUE (var_1_12 / var_1_16) >= var_1_10 [L85] var_1_15 = (var_1_17 + 255.5) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L141] RET step() [L142] CALL, EXPR property() [L132-L133] return (((((((last_1_var_1_1 > (var_1_18 * var_1_18)) ? (var_1_1 == ((unsigned char) (var_1_5 - (var_1_6 + var_1_7)))) : (var_1_1 == ((unsigned char) ((((var_1_7) < ((((((16) < 0 ) ? -(16) : (16))) + var_1_6))) ? (var_1_7) : ((((((16) < 0 ) ? -(16) : (16))) + var_1_6))))))) && (((- var_1_18) > var_1_6) ? (var_1_8 == ((signed long int) ((var_1_9 - var_1_21) - var_1_5))) : 1)) && ((var_1_8 != ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5)))) ? (var_1_10 == ((float) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : ((var_1_13 || var_1_14) ? (var_1_10 == ((float) var_1_11)) : 1))) && (((var_1_12 / var_1_16) >= var_1_10) ? (var_1_15 == ((double) (var_1_17 + 255.5))) : 1)) && ((last_1_var_1_1 > last_1_var_1_18) ? (var_1_18 == ((unsigned long int) ((((var_1_9) < ((var_1_19 - var_1_6))) ? (var_1_9) : ((var_1_19 - var_1_6)))))) : ((var_1_20 || (var_1_9 >= last_1_var_1_22)) ? (var_1_18 == ((unsigned long int) var_1_6)) : (var_1_18 == ((unsigned long int) var_1_7))))) && (var_1_21 == ((signed short int) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) && ((var_1_18 == var_1_8) ? ((! var_1_20) ? (var_1_22 == ((signed char) ((((var_1_6) > ((5 - var_1_7))) ? (var_1_6) : ((5 - var_1_7)))))) : (var_1_22 == ((signed char) (var_1_7 + var_1_23)))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 933 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 670 mSDsCounter, 325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 600 IncrementalHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 325 mSolverCounterUnsat, 263 mSDtfsCounter, 600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 2376 SizeOfPredicates, 4 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4916/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 06:28:02,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f939a31bde08313e00f5c944adf142fba63d3542c78032e0ba52b2cc30f6848 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:28:05,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:28:05,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:28:05,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:28:05,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:28:05,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:28:05,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:28:05,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:28:05,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:28:05,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:28:05,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:28:05,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:28:05,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:28:05,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:28:05,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:28:05,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:28:05,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:28:05,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:28:05,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:28:05,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:28:05,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:28:05,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:28:05,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:28:05,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:28:05,176 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:28:05,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:28:05,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:28:05,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:28:05,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:28:05,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:28:05,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:28:05,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:28:05,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:28:05,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:28:05,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:28:05,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:28:05,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:28:05,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:28:05,185 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:28:05,186 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:28:05,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:28:05,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:28:05,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:28:05,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:28:05,187 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f939a31bde08313e00f5c944adf142fba63d3542c78032e0ba52b2cc30f6848 [2024-11-10 06:28:05,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:28:05,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:28:05,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:28:05,588 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:28:05,588 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:28:05,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i [2024-11-10 06:28:07,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:28:07,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:28:07,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i [2024-11-10 06:28:07,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1bc931b/6c686d14b2f0452d913519a7224c7892/FLAG0f2851870 [2024-11-10 06:28:07,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1bc931b/6c686d14b2f0452d913519a7224c7892 [2024-11-10 06:28:07,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:28:07,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:28:07,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:28:07,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:28:07,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:28:07,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:28:07" (1/1) ... [2024-11-10 06:28:07,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a59dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:07, skipping insertion in model container [2024-11-10 06:28:07,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:28:07" (1/1) ... [2024-11-10 06:28:07,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:28:07,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i[913,926] [2024-11-10 06:28:07,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:28:08,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:28:08,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-12.i[913,926] [2024-11-10 06:28:08,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:28:08,083 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:28:08,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08 WrapperNode [2024-11-10 06:28:08,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:28:08,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:28:08,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:28:08,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:28:08,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,157 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-10 06:28:08,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:28:08,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:28:08,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:28:08,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:28:08,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,202 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:28:08,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:28:08,232 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:28:08,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:28:08,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:28:08,238 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (1/1) ... [2024-11-10 06:28:08,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:28:08,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:28:08,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:28:08,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:28:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:28:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:28:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:28:08,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:28:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:28:08,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:28:08,427 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:28:08,431 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:28:14,354 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 06:28:14,355 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:28:14,375 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:28:14,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:28:14,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:28:14 BoogieIcfgContainer [2024-11-10 06:28:14,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:28:14,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:28:14,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:28:14,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:28:14,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:28:07" (1/3) ... [2024-11-10 06:28:14,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449e645a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:28:14, skipping insertion in model container [2024-11-10 06:28:14,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:28:08" (2/3) ... [2024-11-10 06:28:14,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449e645a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:28:14, skipping insertion in model container [2024-11-10 06:28:14,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:28:14" (3/3) ... [2024-11-10 06:28:14,412 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-12.i [2024-11-10 06:28:14,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:28:14,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:28:14,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:28:14,510 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;@5700fcd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:28:14,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:28:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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-11-10 06:28:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 06:28:14,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:28:14,528 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:28:14,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:28:14,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:28:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1163729006, now seen corresponding path program 1 times [2024-11-10 06:28:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:28:14,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470170750] [2024-11-10 06:28:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:28:14,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:28:14,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:28:14,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:28:14,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 06:28:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:28:15,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:28:15,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:28:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-11-10 06:28:15,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:28:15,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:28:15,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470170750] [2024-11-10 06:28:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470170750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:28:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:28:15,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:28:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771250032] [2024-11-10 06:28:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:28:15,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:28:15,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:28:15,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:28:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:28:15,154 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-11-10 06:28:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:28:15,200 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2024-11-10 06:28:15,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:28:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 147 [2024-11-10 06:28:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:28:15,214 INFO L225 Difference]: With dead ends: 130 [2024-11-10 06:28:15,215 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 06:28:15,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:28:15,227 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:28:15,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:28:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 06:28:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 06:28:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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-11-10 06:28:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-10 06:28:15,312 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 147 [2024-11-10 06:28:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:28:15,316 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-10 06:28:15,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-11-10 06:28:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-10 06:28:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 06:28:15,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:28:15,326 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:28:15,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:28:15,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:28:15,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:28:15,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:28:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash 944211919, now seen corresponding path program 1 times [2024-11-10 06:28:15,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:28:15,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136269768] [2024-11-10 06:28:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:28:15,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:28:15,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:28:15,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:28:15,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:28:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:28:16,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 06:28:16,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:28:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 06:28:18,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:28:18,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:28:18,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136269768] [2024-11-10 06:28:18,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136269768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:28:18,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:28:18,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:28:18,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914618417] [2024-11-10 06:28:18,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:28:18,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:28:18,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:28:18,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:28:18,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:28:18,976 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 06:28:21,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:28:22,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:28:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:28:22,977 INFO L93 Difference]: Finished difference Result 188 states and 281 transitions. [2024-11-10 06:28:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:28:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-11-10 06:28:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:28:23,021 INFO L225 Difference]: With dead ends: 188 [2024-11-10 06:28:23,022 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 06:28:23,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:28:23,024 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:28:23,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 296 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-10 06:28:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 06:28:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2024-11-10 06:28:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 06:28:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2024-11-10 06:28:23,086 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 147 [2024-11-10 06:28:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:28:23,087 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2024-11-10 06:28:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 06:28:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2024-11-10 06:28:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 06:28:23,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:28:23,093 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:28:23,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 06:28:23,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:28:23,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:28:23,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:28:23,296 INFO L85 PathProgramCache]: Analyzing trace with hash 756971732, now seen corresponding path program 1 times [2024-11-10 06:28:23,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:28:23,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058179522] [2024-11-10 06:28:23,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:28:23,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:28:23,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:28:23,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:28:23,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 06:28:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:28:23,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 06:28:23,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:28:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-10 06:28:26,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:28:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 06:28:27,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:28:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058179522] [2024-11-10 06:28:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058179522] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:28:27,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:28:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-11-10 06:28:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076047564] [2024-11-10 06:28:27,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:28:27,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 06:28:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:28:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 06:28:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 06:28:27,254 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-10 06:28:29,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:28:31,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:28:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:28:32,503 INFO L93 Difference]: Finished difference Result 294 states and 432 transitions. [2024-11-10 06:28:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 06:28:32,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 148 [2024-11-10 06:28:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:28:32,509 INFO L225 Difference]: With dead ends: 294 [2024-11-10 06:28:32,509 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 06:28:32,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2024-11-10 06:28:32,514 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 399 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-10 06:28:32,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 443 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-10 06:28:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 06:28:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2024-11-10 06:28:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 115 states have internal predecessors, (136), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-10 06:28:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 286 transitions. [2024-11-10 06:28:32,583 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 286 transitions. Word has length 148 [2024-11-10 06:28:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:28:32,584 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 286 transitions. [2024-11-10 06:28:32,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-10 06:28:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 286 transitions. [2024-11-10 06:28:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 06:28:32,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:28:32,592 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:28:32,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 06:28:32,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:28:32,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:28:32,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:28:32,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1050374739, now seen corresponding path program 1 times [2024-11-10 06:28:32,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:28:32,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36506847] [2024-11-10 06:28:32,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:28:32,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:28:32,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:28:32,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:28:32,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 06:28:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:28:33,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 06:28:33,192 INFO L278 TraceCheckSpWp]: Computing forward predicates...